/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-acceleration/array_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:56:05,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:56:05,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:56:05,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:56:05,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:56:05,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:56:05,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:56:05,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:56:05,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:56:05,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:56:05,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:56:05,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:56:05,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:56:05,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:56:05,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:56:05,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:56:05,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:56:05,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:56:05,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:56:05,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:56:05,639 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:56:05,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:56:05,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:56:05,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:56:05,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:56:05,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:56:05,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:56:05,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:56:05,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:56:05,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:56:05,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:56:05,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:56:05,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:56:05,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:56:05,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:56:05,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:56:05,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:56:05,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:56:05,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:56:05,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:56:05,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:56:05,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:56:05,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:56:05,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:56:05,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:56:05,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:56:05,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:56:05,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:56:05,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:56:05,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:56:05,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:05,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:56:05,670 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:56:05,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:56:05,671 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:56:05,671 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:56:05,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:56:05,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:56:05,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:56:05,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:56:05,864 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:56:05,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-28 02:56:05,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17127e2a2/91e8f6e2d66646208057be66e759bbb6/FLAG01b967b58 [2022-04-28 02:56:06,265 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:56:06,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-28 02:56:06,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17127e2a2/91e8f6e2d66646208057be66e759bbb6/FLAG01b967b58 [2022-04-28 02:56:06,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17127e2a2/91e8f6e2d66646208057be66e759bbb6 [2022-04-28 02:56:06,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:56:06,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:56:06,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:06,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:56:06,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:56:06,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e31ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06, skipping insertion in model container [2022-04-28 02:56:06,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:56:06,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:56:06,470 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-acceleration/array_3-2.i[809,822] [2022-04-28 02:56:06,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:06,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:56:06,531 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-acceleration/array_3-2.i[809,822] [2022-04-28 02:56:06,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:06,558 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:56:06,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06 WrapperNode [2022-04-28 02:56:06,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:06,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:56:06,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:56:06,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:56:06,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:56:06,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:56:06,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:56:06,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:56:06,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (1/1) ... [2022-04-28 02:56:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:06,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:56:06,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:56:06,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:56:06,733 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:56:06,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:56:06,888 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:56:06,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:56:06,893 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 02:56:06,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:06 BoogieIcfgContainer [2022-04-28 02:56:06,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:56:06,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:56:06,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:56:06,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:56:06,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:56:06" (1/3) ... [2022-04-28 02:56:06,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a19222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:06, skipping insertion in model container [2022-04-28 02:56:06,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:06" (2/3) ... [2022-04-28 02:56:06,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a19222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:06, skipping insertion in model container [2022-04-28 02:56:06,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:06" (3/3) ... [2022-04-28 02:56:06,907 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2022-04-28 02:56:06,916 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:56:06,916 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:56:06,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:56:06,973 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21458f6d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d384ee2 [2022-04-28 02:56:06,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:56:06,981 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-28 02:56:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:56:06,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:06,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:06,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 1 times [2022-04-28 02:56:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [23680239] [2022-04-28 02:56:07,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 2 times [2022-04-28 02:56:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356992366] [2022-04-28 02:56:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-28 02:56:07,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 02:56:07,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-28 02:56:07,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:07,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-28 02:56:07,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 02:56:07,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-28 02:56:07,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-28 02:56:07,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2022-04-28 02:56:07,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 02:56:07,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2022-04-28 02:56:07,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-04-28 02:56:07,133 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29#false} is VALID [2022-04-28 02:56:07,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 02:56:07,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 02:56:07,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 02:56:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:07,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356992366] [2022-04-28 02:56:07,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356992366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:07,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:07,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:07,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [23680239] [2022-04-28 02:56:07,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [23680239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:07,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364523496] [2022-04-28 02:56:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-28 02:56:07,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:07,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:56:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:56:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:07,178 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,230 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 02:56:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:56:07,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-28 02:56:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-28 02:56:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-28 02:56:07,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-28 02:56:07,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,291 INFO L225 Difference]: With dead ends: 42 [2022-04-28 02:56:07,291 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:56:07,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:07,295 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:07,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:56:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 02:56:07,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:07,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,316 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,316 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,318 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:56:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:56:07,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:07,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:07,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:56:07,319 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:56:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,320 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:56:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:56:07,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:07,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:07,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:07,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 02:56:07,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-28 02:56:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:07,329 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 02:56:07,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 02:56:07,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:56:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:07,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:07,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:56:07,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 1 times [2022-04-28 02:56:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440308206] [2022-04-28 02:56:07,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 2 times [2022-04-28 02:56:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:07,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453797468] [2022-04-28 02:56:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:07,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#(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(12, 2); {192#true} is VALID [2022-04-28 02:56:07,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-28 02:56:07,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-28 02:56:07,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:07,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#(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(12, 2); {192#true} is VALID [2022-04-28 02:56:07,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-28 02:56:07,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-28 02:56:07,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {192#true} call #t~ret6 := main(); {192#true} is VALID [2022-04-28 02:56:07,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {197#(= main_~i~0 0)} is VALID [2022-04-28 02:56:07,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(= main_~i~0 0)} assume !(~i~0 < 1024); {193#false} is VALID [2022-04-28 02:56:07,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#false} ~i~0 := 0; {193#false} is VALID [2022-04-28 02:56:07,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#false} #t~short5 := ~i~0 < 1024; {193#false} is VALID [2022-04-28 02:56:07,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {193#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {193#false} is VALID [2022-04-28 02:56:07,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {193#false} is VALID [2022-04-28 02:56:07,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {193#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {193#false} is VALID [2022-04-28 02:56:07,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2022-04-28 02:56:07,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2022-04-28 02:56:07,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-04-28 02:56:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:07,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:07,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453797468] [2022-04-28 02:56:07,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453797468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:07,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:07,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440308206] [2022-04-28 02:56:07,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440308206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:07,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565520746] [2022-04-28 02:56:07,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-28 02:56:07,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:07,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:07,470 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,564 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 02:56:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-28 02:56:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:56:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 02:56:07,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 02:56:07,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,607 INFO L225 Difference]: With dead ends: 35 [2022-04-28 02:56:07,607 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:56:07,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:56:07,610 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:07,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:56:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-28 02:56:07,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:07,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,620 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,620 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,621 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 02:56:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 02:56:07,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:07,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:07,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:56:07,623 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:56:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:07,625 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 02:56:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 02:56:07,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:07,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:07,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:07,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 02:56:07,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 02:56:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:07,629 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 02:56:07,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 02:56:07,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:56:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:56:07,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:07,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:07,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:56:07,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 1 times [2022-04-28 02:56:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519552498] [2022-04-28 02:56:07,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:07,674 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:07,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 2 times [2022-04-28 02:56:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:07,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341571359] [2022-04-28 02:56:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(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(12, 2); {361#true} is VALID [2022-04-28 02:56:07,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 02:56:07,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-28 02:56:07,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:07,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(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(12, 2); {361#true} is VALID [2022-04-28 02:56:07,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 02:56:07,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-28 02:56:07,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 02:56:07,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {366#(= main_~i~0 0)} is VALID [2022-04-28 02:56:07,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {366#(= main_~i~0 0)} is VALID [2022-04-28 02:56:07,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {367#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:07,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(<= main_~i~0 1)} assume !(~i~0 < 1024); {362#false} is VALID [2022-04-28 02:56:07,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#false} ~i~0 := 0; {362#false} is VALID [2022-04-28 02:56:07,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#false} #t~short5 := ~i~0 < 1024; {362#false} is VALID [2022-04-28 02:56:07,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {362#false} is VALID [2022-04-28 02:56:07,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {362#false} is VALID [2022-04-28 02:56:07,767 INFO L272 TraceCheckUtils]: 13: Hoare triple {362#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {362#false} is VALID [2022-04-28 02:56:07,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-28 02:56:07,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-28 02:56:07,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 02:56:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:07,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:07,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341571359] [2022-04-28 02:56:07,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341571359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:07,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290595602] [2022-04-28 02:56:07,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:07,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:07,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:56:07,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 02:56:07,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:07,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:56:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:07,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:07,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-28 02:56:07,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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(12, 2); {361#true} is VALID [2022-04-28 02:56:07,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 02:56:07,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-28 02:56:07,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 02:56:07,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {361#true} is VALID [2022-04-28 02:56:07,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {361#true} is VALID [2022-04-28 02:56:07,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {361#true} is VALID [2022-04-28 02:56:07,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(~i~0 < 1024); {361#true} is VALID [2022-04-28 02:56:07,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} ~i~0 := 0; {399#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {399#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {399#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#(<= main_~i~0 0)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {399#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:07,959 INFO L272 TraceCheckUtils]: 13: Hoare triple {399#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:07,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:07,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {362#false} is VALID [2022-04-28 02:56:07,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 02:56:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:56:07,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:56:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290595602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 02:56:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-28 02:56:07,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:07,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519552498] [2022-04-28 02:56:07,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519552498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:07,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:07,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:56:07,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760683822] [2022-04-28 02:56:07,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:07,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:56:07,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:07,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:07,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:56:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:56:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:56:07,976 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,049 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 02:56:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:56:08,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:56:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 02:56:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 02:56:08,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 02:56:08,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,073 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:56:08,073 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:56:08,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:56:08,074 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:08,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:56:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-28 02:56:08,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:08,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,081 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,081 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,082 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 02:56:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 02:56:08,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:08,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:08,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:08,083 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:56:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,084 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 02:56:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 02:56:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:08,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:08,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:08,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-28 02:56:08,085 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-04-28 02:56:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:08,086 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-28 02:56:08,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-28 02:56:08,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 02:56:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:56:08,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:08,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:08,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:08,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:08,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 1 times [2022-04-28 02:56:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:08,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929203901] [2022-04-28 02:56:08,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:08,328 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:08,329 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 2 times [2022-04-28 02:56:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:08,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981701051] [2022-04-28 02:56:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:08,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#(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(12, 2); {574#true} is VALID [2022-04-28 02:56:08,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 02:56:08,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-28 02:56:08,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:08,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#(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(12, 2); {574#true} is VALID [2022-04-28 02:56:08,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 02:56:08,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-28 02:56:08,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-28 02:56:08,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {579#(= main_~i~0 0)} is VALID [2022-04-28 02:56:08,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {579#(= main_~i~0 0)} is VALID [2022-04-28 02:56:08,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:08,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-28 02:56:08,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-28 02:56:08,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-28 02:56:08,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,377 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-28 02:56:08,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-28 02:56:08,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-28 02:56:08,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 02:56:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:56:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:08,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981701051] [2022-04-28 02:56:08,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981701051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:08,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390798754] [2022-04-28 02:56:08,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:08,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:08,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:08,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:56:08,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:08,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:08,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 02:56:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:08,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:08,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-28 02:56:08,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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(12, 2); {574#true} is VALID [2022-04-28 02:56:08,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 02:56:08,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-28 02:56:08,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-28 02:56:08,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:08,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:08,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:08,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-28 02:56:08,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-28 02:56:08,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,508 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-28 02:56:08,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-28 02:56:08,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-28 02:56:08,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 02:56:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:56:08,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:08,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 02:56:08,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-28 02:56:08,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-28 02:56:08,601 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-28 02:56:08,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-28 02:56:08,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-28 02:56:08,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-28 02:56:08,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-28 02:56:08,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-28 02:56:08,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(< main_~i~0 1024)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-28 02:56:08,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {682#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:08,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {686#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:08,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {686#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:08,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-28 02:56:08,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-28 02:56:08,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 02:56:08,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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(12, 2); {574#true} is VALID [2022-04-28 02:56:08,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-28 02:56:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:56:08,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390798754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:08,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:08,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:56:08,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:08,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929203901] [2022-04-28 02:56:08,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929203901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:08,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:08,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:56:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696825757] [2022-04-28 02:56:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:08,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 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 21 [2022-04-28 02:56:08,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:08,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:56:08,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:56:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:56:08,623 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,718 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 02:56:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:56:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 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 21 [2022-04-28 02:56:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 02:56:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 02:56:08,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 02:56:08,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,752 INFO L225 Difference]: With dead ends: 44 [2022-04-28 02:56:08,752 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 02:56:08,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:56:08,753 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:08,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 02:56:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-28 02:56:08,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:08,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,763 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,763 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,764 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 02:56:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 02:56:08,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:08,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:08,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:56:08,765 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:56:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:08,766 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 02:56:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 02:56:08,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:08,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:08,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:08,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 02:56:08,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2022-04-28 02:56:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:08,768 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 02:56:08,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:08,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 02:56:08,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 02:56:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:56:08,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:08,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:08,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:09,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 02:56:09,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 3 times [2022-04-28 02:56:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:09,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863529820] [2022-04-28 02:56:09,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:09,010 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:09,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 4 times [2022-04-28 02:56:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275596100] [2022-04-28 02:56:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:09,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(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(12, 2); {912#true} is VALID [2022-04-28 02:56:09,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 02:56:09,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-28 02:56:09,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(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(12, 2); {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-28 02:56:09,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#true} assume !(~i~0 < 1024); {912#true} is VALID [2022-04-28 02:56:09,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {917#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {917#(= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {917#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {917#(= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {917#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~i~0 1)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,088 INFO L272 TraceCheckUtils]: 19: Hoare triple {918#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:56:09,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {919#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {920#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:09,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-28 02:56:09,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 02:56:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:56:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275596100] [2022-04-28 02:56:09,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275596100] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888785625] [2022-04-28 02:56:09,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:09,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:09,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 02:56:09,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:09,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:09,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:56:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:09,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:09,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-28 02:56:09,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#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(12, 2); {912#true} is VALID [2022-04-28 02:56:09,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 02:56:09,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-28 02:56:09,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-28 02:56:09,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:09,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {940#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:09,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {918#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {953#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:09,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {953#(<= main_~i~0 2)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-28 02:56:09,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-28 02:56:09,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-28 02:56:09,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-28 02:56:09,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-28 02:56:09,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 02:56:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:56:09,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:09,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-28 02:56:09,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-28 02:56:09,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-28 02:56:09,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-28 02:56:09,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-28 02:56:09,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(< main_~i~0 1024)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-28 02:56:09,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1029#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:09,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1033#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:09,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {1040#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1033#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:09,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {1040#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1040#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:09,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1040#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:09,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-28 02:56:09,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-28 02:56:09,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 02:56:09,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#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(12, 2); {912#true} is VALID [2022-04-28 02:56:09,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-28 02:56:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:56:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888785625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:09,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:09,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-28 02:56:09,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1863529820] [2022-04-28 02:56:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1863529820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:09,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:09,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597240122] [2022-04-28 02:56:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 23 [2022-04-28 02:56:09,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:09,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:56:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:56:09,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:09,340 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:09,524 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 02:56:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 23 [2022-04-28 02:56:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 02:56:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 02:56:09,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-28 02:56:09,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:09,577 INFO L225 Difference]: With dead ends: 35 [2022-04-28 02:56:09,577 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:56:09,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:56:09,578 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:09,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:56:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-28 02:56:09,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:09,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,615 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,615 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:09,616 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:56:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:56:09,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:09,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:09,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:56:09,617 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 02:56:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:09,618 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:56:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:56:09,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:09,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:09,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:09,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 02:56:09,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2022-04-28 02:56:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:09,619 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 02:56:09,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:09,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 02:56:09,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 02:56:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 02:56:09,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:09,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:09,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:09,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 5 times [2022-04-28 02:56:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:09,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999012727] [2022-04-28 02:56:09,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:09,873 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:09,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 6 times [2022-04-28 02:56:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678701932] [2022-04-28 02:56:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:09,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#(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(12, 2); {1260#true} is VALID [2022-04-28 02:56:09,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 02:56:09,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-28 02:56:09,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:09,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(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(12, 2); {1260#true} is VALID [2022-04-28 02:56:09,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 02:56:09,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-28 02:56:09,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-28 02:56:09,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1265#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1265#(= main_~i~0 0)} is VALID [2022-04-28 02:56:09,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:09,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1267#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:09,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {1267#(<= main_~i~0 2)} assume !(~i~0 < 1024); {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#false} ~i~0 := 0; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-28 02:56:09,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 02:56:09,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 02:56:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:09,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678701932] [2022-04-28 02:56:09,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678701932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:09,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49801436] [2022-04-28 02:56:09,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:09,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:56:10,046 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 02:56:10,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:10,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(12, 2); {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-28 02:56:10,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-28 02:56:10,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-28 02:56:10,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-28 02:56:10,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-28 02:56:10,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1305#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:10,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {1305#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:10,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1305#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:10,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1305#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:10,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1305#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {1266#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {1266#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1266#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1267#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {1267#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {1267#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {1267#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1267#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {1267#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1267#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {1267#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:10,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:10,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 02:56:10,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 02:56:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:56:10,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:10,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 02:56:10,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 02:56:10,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:10,327 INFO L272 TraceCheckUtils]: 23: Hoare triple {1362#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:10,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {1362#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1362#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:10,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1362#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:10,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {1362#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:10,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {1375#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1362#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:10,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {1375#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1375#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:10,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1375#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1375#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:10,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {1375#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:10,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1375#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:10,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1388#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1388#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1388#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1388#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1388#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {1388#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1388#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-28 02:56:10,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(12, 2); {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 02:56:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:56:10,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49801436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:10,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:10,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-04-28 02:56:10,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999012727] [2022-04-28 02:56:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999012727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:10,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:10,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:56:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239040729] [2022-04-28 02:56:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 27 [2022-04-28 02:56:10,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:10,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:10,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:56:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:56:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:10,347 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:10,475 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-28 02:56:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:56:10,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 27 [2022-04-28 02:56:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 02:56:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 02:56:10,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-28 02:56:10,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:10,512 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:56:10,512 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 02:56:10,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:56:10,513 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:10,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 02:56:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-28 02:56:10,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:10,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,528 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,528 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:10,529 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 02:56:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 02:56:10,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:10,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:10,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 02:56:10,529 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 02:56:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:10,530 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 02:56:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-28 02:56:10,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:10,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:10,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:10,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-28 02:56:10,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2022-04-28 02:56:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:10,531 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-28 02:56:10,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:10,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-28 02:56:10,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:56:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:56:10,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:10,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:10,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:10,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:10,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 7 times [2022-04-28 02:56:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980255843] [2022-04-28 02:56:10,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:10,784 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:10,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 8 times [2022-04-28 02:56:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:10,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337629862] [2022-04-28 02:56:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {1693#(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(12, 2); {1684#true} is VALID [2022-04-28 02:56:10,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-28 02:56:10,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-28 02:56:10,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1693#(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(12, 2); {1684#true} is VALID [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-28 02:56:10,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-28 02:56:10,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2022-04-28 02:56:10,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(= main_~i~0 0)} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1689#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:10,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:10,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:10,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-28 02:56:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337629862] [2022-04-28 02:56:10,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337629862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742841827] [2022-04-28 02:56:10,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:10,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:10,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:56:10,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:10,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:10,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:56:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:10,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:11,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-28 02:56:11,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#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(12, 2); {1684#true} is VALID [2022-04-28 02:56:11,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-28 02:56:11,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-28 02:56:11,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-28 02:56:11,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1712#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:11,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1712#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1712#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:11,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:11,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,029 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-28 02:56:11,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-28 02:56:11,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-28 02:56:11,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-28 02:56:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:11,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:11,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-28 02:56:11,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-28 02:56:11,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-28 02:56:11,144 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-28 02:56:11,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-28 02:56:11,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-28 02:56:11,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-28 02:56:11,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:11,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1834#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:11,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1834#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:11,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1841#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:11,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1841#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:11,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1848#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:11,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1848#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:11,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-28 02:56:11,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-28 02:56:11,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-28 02:56:11,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#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(12, 2); {1684#true} is VALID [2022-04-28 02:56:11,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-28 02:56:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742841827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:11,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:56:11,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980255843] [2022-04-28 02:56:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980255843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:11,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343652988] [2022-04-28 02:56:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:11,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 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 29 [2022-04-28 02:56:11,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:11,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:56:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:56:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:56:11,172 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:11,354 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 02:56:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 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 29 [2022-04-28 02:56:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 02:56:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 02:56:11,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-28 02:56:11,408 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-28 02:56:11,409 INFO L225 Difference]: With dead ends: 61 [2022-04-28 02:56:11,409 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 02:56:11,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:56:11,410 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:11,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 02:56:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-04-28 02:56:11,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:11,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,434 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,434 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:11,435 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 02:56:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 02:56:11,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:11,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:11,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:56:11,436 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 02:56:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:11,437 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 02:56:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 02:56:11,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:11,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:11,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:11,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 02:56:11,455 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2022-04-28 02:56:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:11,455 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 02:56:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:11,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 02:56:11,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 02:56:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 02:56:11,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:11,487 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:11,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 02:56:11,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:11,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 9 times [2022-04-28 02:56:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:11,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350643493] [2022-04-28 02:56:11,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:11,710 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:11,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 10 times [2022-04-28 02:56:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:11,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260333291] [2022-04-28 02:56:11,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:11,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {2164#(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(12, 2); {2154#true} is VALID [2022-04-28 02:56:11,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-28 02:56:11,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-28 02:56:11,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:11,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#(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(12, 2); {2154#true} is VALID [2022-04-28 02:56:11,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-28 02:56:11,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-28 02:56:11,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-28 02:56:11,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2159#(= main_~i~0 0)} is VALID [2022-04-28 02:56:11,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {2159#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2159#(= main_~i~0 0)} is VALID [2022-04-28 02:56:11,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {2159#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:11,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:11,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:11,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,782 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-28 02:56:11,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-28 02:56:11,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-28 02:56:11,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-28 02:56:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260333291] [2022-04-28 02:56:11,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260333291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957042749] [2022-04-28 02:56:11,782 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:11,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:11,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:56:11,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:11,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:11,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:11,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:11,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-28 02:56:11,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#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(12, 2); {2154#true} is VALID [2022-04-28 02:56:11,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-28 02:56:11,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-28 02:56:11,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-28 02:56:11,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2183#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:11,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {2183#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2183#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:11,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {2183#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:11,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:11,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:11,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:11,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:11,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:11,929 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-28 02:56:11,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-28 02:56:11,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-28 02:56:11,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-28 02:56:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:11,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:12,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-28 02:56:12,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {2307#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-28 02:56:12,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2307#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:12,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {2311#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2311#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:12,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2311#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:12,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {2318#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2318#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:12,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2318#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:12,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2325#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:12,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {2332#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2325#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:12,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {2332#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2332#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:12,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2332#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:12,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-28 02:56:12,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-28 02:56:12,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-28 02:56:12,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#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(12, 2); {2154#true} is VALID [2022-04-28 02:56:12,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-28 02:56:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957042749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:12,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 02:56:12,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350643493] [2022-04-28 02:56:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350643493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:12,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:56:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299389738] [2022-04-28 02:56:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:12,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 02:56:12,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:12,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:12,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:56:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:56:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:56:12,105 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:12,319 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-28 02:56:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:56:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 02:56:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-28 02:56:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-28 02:56:12,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-28 02:56:12,367 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-28 02:56:12,369 INFO L225 Difference]: With dead ends: 68 [2022-04-28 02:56:12,369 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 02:56:12,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:56:12,369 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:12,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 02:56:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2022-04-28 02:56:12,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:12,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,404 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,404 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:12,406 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-28 02:56:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 02:56:12,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:12,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:12,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 02:56:12,406 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 02:56:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:12,407 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-28 02:56:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 02:56:12,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:12,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:12,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:12,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 02:56:12,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 31 [2022-04-28 02:56:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:12,409 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 02:56:12,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:12,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 02:56:12,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 02:56:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:56:12,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:12,438 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:12,455 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-28 02:56:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:12,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 11 times [2022-04-28 02:56:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684672421] [2022-04-28 02:56:12,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:12,659 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:12,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 12 times [2022-04-28 02:56:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:12,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120126642] [2022-04-28 02:56:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:12,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2683#(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(12, 2); {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:12,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#(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(12, 2); {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-28 02:56:12,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-28 02:56:12,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2677#(= main_~i~0 0)} is VALID [2022-04-28 02:56:12,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2677#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2677#(= main_~i~0 0)} is VALID [2022-04-28 02:56:12,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2677#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2679#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {2679#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2680#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:12,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2680#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:12,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2680#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2681#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:12,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2681#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2681#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2682#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= main_~i~0 5)} assume !(~i~0 < 1024); {2673#false} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {2673#false} ~i~0 := 0; {2673#false} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-28 02:56:12,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {2673#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L272 TraceCheckUtils]: 29: Hoare triple {2673#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-28 02:56:12,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-28 02:56:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:12,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:12,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120126642] [2022-04-28 02:56:12,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120126642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:12,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022223355] [2022-04-28 02:56:12,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:12,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:12,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:12,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:56:12,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:12,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:12,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:12,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:12,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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(12, 2); {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:12,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-28 02:56:12,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2738#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:12,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2738#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {2738#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:12,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {2738#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2738#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:12,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {2738#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2738#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:12,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2738#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {2678#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {2678#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {2678#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2678#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:12,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {2678#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {2679#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {2679#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {2679#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2679#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:12,897 INFO L272 TraceCheckUtils]: 29: Hoare triple {2679#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:12,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:12,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-28 02:56:12,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-28 02:56:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 02:56:12,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:13,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-28 02:56:13,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-28 02:56:13,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:13,035 INFO L272 TraceCheckUtils]: 29: Hoare triple {2795#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:13,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2795#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:13,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2795#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:13,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {2795#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:13,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {2808#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2795#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:13,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {2808#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2808#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:13,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {2808#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2808#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:13,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {2808#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {2808#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:13,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {2821#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2808#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:13,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {2821#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2821#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:13,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {2821#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2821#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:13,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {2821#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {2821#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:13,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2821#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:13,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-28 02:56:13,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-28 02:56:13,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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(12, 2); {2672#true} is VALID [2022-04-28 02:56:13,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-28 02:56:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 02:56:13,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022223355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:13,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:13,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-28 02:56:13,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684672421] [2022-04-28 02:56:13,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684672421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:13,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:13,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:56:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525250165] [2022-04-28 02:56:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:56:13,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:13,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:13,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:56:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:56:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:56:13,058 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:13,380 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-28 02:56:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:56:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 02:56:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-28 02:56:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-28 02:56:13,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-04-28 02:56:13,462 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-28 02:56:13,464 INFO L225 Difference]: With dead ends: 75 [2022-04-28 02:56:13,464 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 02:56:13,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:56:13,466 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:13,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 02:56:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-04-28 02:56:13,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:13,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,498 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,498 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:13,500 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-28 02:56:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-28 02:56:13,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:13,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:13,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:56:13,507 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 02:56:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:13,509 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-28 02:56:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-28 02:56:13,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:13,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:13,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:13,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-28 02:56:13,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 33 [2022-04-28 02:56:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:13,510 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-28 02:56:13,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:13,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-28 02:56:13,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 02:56:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 02:56:13,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:13,542 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:13,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:13,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:13,761 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 13 times [2022-04-28 02:56:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:13,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667948009] [2022-04-28 02:56:13,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:13,766 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:13,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 14 times [2022-04-28 02:56:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165696312] [2022-04-28 02:56:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:13,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {3249#(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(12, 2); {3237#true} is VALID [2022-04-28 02:56:13,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-28 02:56:13,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-28 02:56:13,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:13,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {3249#(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(12, 2); {3237#true} is VALID [2022-04-28 02:56:13,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-28 02:56:13,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-28 02:56:13,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-28 02:56:13,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3242#(= main_~i~0 0)} is VALID [2022-04-28 02:56:13,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {3242#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3242#(= main_~i~0 0)} is VALID [2022-04-28 02:56:13,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:13,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:13,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:13,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:13,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:13,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:13,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:13,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:13,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:13,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:13,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-28 02:56:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:13,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165696312] [2022-04-28 02:56:13,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165696312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256142481] [2022-04-28 02:56:13,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:13,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:13,869 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:56:13,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:13,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:13,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:56:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:13,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:14,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-28 02:56:14,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#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(12, 2); {3237#true} is VALID [2022-04-28 02:56:14,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-28 02:56:14,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-28 02:56:14,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-28 02:56:14,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3268#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:14,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {3268#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3268#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:14,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3268#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:14,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:14,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:14,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:14,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:14,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:14,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:14,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:14,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:14,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:14,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:14,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-28 02:56:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:14,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:14,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-28 02:56:14,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-28 02:56:14,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-28 02:56:14,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-28 02:56:14,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {3404#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-28 02:56:14,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {3408#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3404#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:14,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {3408#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3408#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:14,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {3415#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3408#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:14,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {3415#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3415#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:14,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {3422#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3415#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:14,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {3422#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3422#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:14,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3422#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:14,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3429#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:14,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {3436#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3429#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:14,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {3436#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3436#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:14,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3436#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:14,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {3443#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3443#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:14,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3443#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:14,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-28 02:56:14,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-28 02:56:14,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-28 02:56:14,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#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(12, 2); {3237#true} is VALID [2022-04-28 02:56:14,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-28 02:56:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:14,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256142481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:14,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:14,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 02:56:14,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:14,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667948009] [2022-04-28 02:56:14,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667948009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:14,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:14,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:56:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934922777] [2022-04-28 02:56:14,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 02:56:14,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:14,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:14,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:56:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:56:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:56:14,333 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:14,640 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-04-28 02:56:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:56:14,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 02:56:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 02:56:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 02:56:14,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-28 02:56:14,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:14,700 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:56:14,700 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 02:56:14,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:56:14,701 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:14,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 22 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 02:56:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-04-28 02:56:14,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:14,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,735 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,735 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:14,736 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 02:56:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-28 02:56:14,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:14,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:14,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 02:56:14,737 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 02:56:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:14,738 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 02:56:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-28 02:56:14,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:14,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:14,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:14,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 02:56:14,739 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 35 [2022-04-28 02:56:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:14,739 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 02:56:14,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:14,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 02:56:14,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 02:56:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 02:56:14,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:14,790 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:14,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 02:56:15,005 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 15 times [2022-04-28 02:56:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:15,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008588559] [2022-04-28 02:56:15,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:15,011 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:15,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 16 times [2022-04-28 02:56:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:15,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063450691] [2022-04-28 02:56:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:15,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(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(12, 2); {3851#true} is VALID [2022-04-28 02:56:15,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 02:56:15,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-28 02:56:15,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:15,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(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(12, 2); {3851#true} is VALID [2022-04-28 02:56:15,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 02:56:15,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-28 02:56:15,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-28 02:56:15,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3856#(= main_~i~0 0)} is VALID [2022-04-28 02:56:15,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {3856#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3856#(= main_~i~0 0)} is VALID [2022-04-28 02:56:15,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {3856#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:15,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:15,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:15,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:15,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:15,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:15,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:15,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:15,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:15,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:15,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:15,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:15,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-28 02:56:15,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 02:56:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:15,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:15,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063450691] [2022-04-28 02:56:15,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063450691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:15,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298250712] [2022-04-28 02:56:15,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:15,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:15,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:56:15,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:15,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:15,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 02:56:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:15,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:15,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-28 02:56:15,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#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(12, 2); {3851#true} is VALID [2022-04-28 02:56:15,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 02:56:15,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-28 02:56:15,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-28 02:56:15,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3883#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:15,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {3883#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3883#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:15,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:15,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:15,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:15,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:15,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:15,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:15,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:15,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:15,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:15,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:15,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:15,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:15,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 02:56:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:15,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:15,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 02:56:15,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-28 02:56:15,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-28 02:56:15,534 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-28 02:56:15,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-28 02:56:15,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-28 02:56:15,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-28 02:56:15,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-28 02:56:15,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4025#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:15,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4029#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:15,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {4036#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4029#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:15,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {4036#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4036#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:15,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {4043#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4036#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:15,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {4043#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4043#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:15,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4043#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:15,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4050#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:15,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {4057#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4050#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:15,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {4057#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4057#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:15,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4057#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:15,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4064#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:15,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {4071#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4064#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:15,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {4071#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4071#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:15,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4071#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:15,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-28 02:56:15,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-28 02:56:15,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 02:56:15,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#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(12, 2); {3851#true} is VALID [2022-04-28 02:56:15,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-28 02:56:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:15,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298250712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:15,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:15,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 02:56:15,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008588559] [2022-04-28 02:56:15,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008588559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:15,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:15,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:56:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254675026] [2022-04-28 02:56:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:15,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 02:56:15,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:15,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:15,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:15,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:56:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:56:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:56:15,563 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:15,903 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2022-04-28 02:56:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:56:15,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 02:56:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-28 02:56:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-28 02:56:15,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-04-28 02:56:15,969 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-28 02:56:15,971 INFO L225 Difference]: With dead ends: 89 [2022-04-28 02:56:15,971 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 02:56:15,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:56:15,972 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 129 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:15,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 32 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 02:56:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-04-28 02:56:16,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:16,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,012 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,012 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:16,014 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-28 02:56:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-28 02:56:16,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:16,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:16,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:56:16,015 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 02:56:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:16,016 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-28 02:56:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-28 02:56:16,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:16,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:16,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:16,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-28 02:56:16,018 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2022-04-28 02:56:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:16,018 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-28 02:56:16,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-28 02:56:16,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-28 02:56:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 02:56:16,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:16,054 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:16,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:16,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:16,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 17 times [2022-04-28 02:56:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:16,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507885718] [2022-04-28 02:56:16,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:16,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:16,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 18 times [2022-04-28 02:56:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:16,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361659026] [2022-04-28 02:56:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:16,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {4527#(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(12, 2); {4513#true} is VALID [2022-04-28 02:56:16,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-28 02:56:16,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-28 02:56:16,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:16,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {4527#(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(12, 2); {4513#true} is VALID [2022-04-28 02:56:16,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-28 02:56:16,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-28 02:56:16,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-28 02:56:16,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4518#(= main_~i~0 0)} is VALID [2022-04-28 02:56:16,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {4518#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4518#(= main_~i~0 0)} is VALID [2022-04-28 02:56:16,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {4518#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {4519#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4519#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {4520#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4520#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4521#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:16,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4521#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:16,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4521#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4522#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:16,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {4522#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4522#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:16,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {4522#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4523#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:16,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {4523#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4523#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:16,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {4523#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4524#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:16,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {4524#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4524#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:16,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4525#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:16,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4525#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4526#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {4526#(<= main_~i~0 8)} assume !(~i~0 < 1024); {4514#false} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#false} ~i~0 := 0; {4514#false} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-28 02:56:16,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L272 TraceCheckUtils]: 35: Hoare triple {4514#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {4514#false} ~cond := #in~cond; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {4514#false} assume 0 == ~cond; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-28 02:56:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:16,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361659026] [2022-04-28 02:56:16,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361659026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:16,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118947525] [2022-04-28 02:56:16,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:16,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:16,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 02:56:16,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:16,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:16,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:16,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:16,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#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(12, 2); {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-28 02:56:16,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:16,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {4600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:16,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {4600#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:16,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {4600#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4600#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:16,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {4600#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {4519#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {4519#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {4519#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4519#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:16,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {4519#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {4520#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {4520#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {4520#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4520#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:16,621 INFO L272 TraceCheckUtils]: 35: Hoare triple {4520#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:16,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:16,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-28 02:56:16,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-28 02:56:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 02:56:16,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:16,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-28 02:56:16,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-28 02:56:16,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:16,761 INFO L272 TraceCheckUtils]: 35: Hoare triple {4657#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:16,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {4657#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4657#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:16,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {4657#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4657#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:16,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {4657#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {4657#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:16,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {4670#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4657#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:16,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {4670#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4670#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:16,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4670#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:16,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {4670#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:16,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {4683#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4670#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:16,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4683#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {4683#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4683#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {4683#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {4683#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4683#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-28 02:56:16,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-28 02:56:16,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-28 02:56:16,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#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(12, 2); {4513#true} is VALID [2022-04-28 02:56:16,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-28 02:56:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 02:56:16,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118947525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:16,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:16,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-04-28 02:56:16,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507885718] [2022-04-28 02:56:16,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507885718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:16,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:16,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:56:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142789994] [2022-04-28 02:56:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 02:56:16,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:16,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:16,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:16,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:56:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:56:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:56:16,798 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,219 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 02:56:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:56:17,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 02:56:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-28 02:56:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-28 02:56:17,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2022-04-28 02:56:17,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:17,298 INFO L225 Difference]: With dead ends: 96 [2022-04-28 02:56:17,298 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 02:56:17,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2022-04-28 02:56:17,299 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:17,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 32 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 02:56:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 42. [2022-04-28 02:56:17,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:17,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,348 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,349 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,350 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-28 02:56:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-28 02:56:17,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:17,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:17,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 02:56:17,350 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 02:56:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:17,352 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-28 02:56:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-28 02:56:17,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:17,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:17,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:17,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-28 02:56:17,353 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 39 [2022-04-28 02:56:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:17,353 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-28 02:56:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:17,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-28 02:56:17,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 02:56:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 02:56:17,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:17,395 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:17,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:17,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 02:56:17,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 19 times [2022-04-28 02:56:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:17,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446143667] [2022-04-28 02:56:17,615 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:17,615 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:17,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 20 times [2022-04-28 02:56:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:17,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297403923] [2022-04-28 02:56:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {5234#(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(12, 2); {5219#true} is VALID [2022-04-28 02:56:17,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-28 02:56:17,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-28 02:56:17,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:17,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {5234#(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(12, 2); {5219#true} is VALID [2022-04-28 02:56:17,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-28 02:56:17,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-28 02:56:17,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-28 02:56:17,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5224#(= main_~i~0 0)} is VALID [2022-04-28 02:56:17,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5224#(= main_~i~0 0)} is VALID [2022-04-28 02:56:17,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-28 02:56:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297403923] [2022-04-28 02:56:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297403923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657189769] [2022-04-28 02:56:17,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:17,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:17,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:17,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:17,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 02:56:17,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:17,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:17,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 02:56:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:17,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:17,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-28 02:56:17,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#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(12, 2); {5219#true} is VALID [2022-04-28 02:56:17,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-28 02:56:17,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-28 02:56:17,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-28 02:56:17,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5253#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:17,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {5253#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5253#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:17,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {5253#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:17,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:17,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:17,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:17,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:17,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:17,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:17,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-28 02:56:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:17,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:18,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-28 02:56:18,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-28 02:56:18,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-28 02:56:18,186 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-28 02:56:18,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:18,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-28 02:56:18,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-28 02:56:18,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-28 02:56:18,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {5411#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:18,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {5411#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5411#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:18,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {5418#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:18,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {5418#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5418#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:18,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {5425#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5418#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:18,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {5425#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5425#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:18,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {5432#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5425#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:18,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {5432#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5432#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:18,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {5439#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5432#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:18,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {5439#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5439#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:18,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {5446#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5439#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:18,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {5446#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5446#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:18,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {5453#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5446#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:18,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {5453#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5453#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:18,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {5460#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5453#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:18,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {5460#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5460#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:18,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {5467#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5460#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:18,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {5467#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5467#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:18,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5467#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:18,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-28 02:56:18,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-28 02:56:18,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-28 02:56:18,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#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(12, 2); {5219#true} is VALID [2022-04-28 02:56:18,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-28 02:56:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:18,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657189769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:18,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:18,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 02:56:18,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:18,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446143667] [2022-04-28 02:56:18,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446143667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:18,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:18,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:56:18,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977128305] [2022-04-28 02:56:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 02:56:18,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:18,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:18,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:56:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:56:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:56:18,216 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:18,819 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-28 02:56:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:56:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 02:56:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-28 02:56:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-28 02:56:18,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2022-04-28 02:56:18,909 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-28 02:56:18,910 INFO L225 Difference]: With dead ends: 103 [2022-04-28 02:56:18,910 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 02:56:18,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:56:18,911 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:18,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 27 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 02:56:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 44. [2022-04-28 02:56:18,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:18,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,972 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,972 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:18,974 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-28 02:56:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-28 02:56:18,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:18,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:18,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:56:18,974 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 02:56:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:18,975 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-28 02:56:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-28 02:56:18,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:18,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:18,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:18,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-28 02:56:18,977 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 41 [2022-04-28 02:56:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:18,977 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-28 02:56:18,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:18,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-28 02:56:19,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 02:56:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 02:56:19,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:19,025 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:19,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:19,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 02:56:19,242 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 21 times [2022-04-28 02:56:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306274573] [2022-04-28 02:56:19,245 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:19,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:19,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 22 times [2022-04-28 02:56:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758689483] [2022-04-28 02:56:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:19,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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(12, 2); {5977#true} is VALID [2022-04-28 02:56:19,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-28 02:56:19,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-28 02:56:19,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:19,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(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(12, 2); {5977#true} is VALID [2022-04-28 02:56:19,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-28 02:56:19,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-28 02:56:19,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-28 02:56:19,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5982#(= main_~i~0 0)} is VALID [2022-04-28 02:56:19,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5982#(= main_~i~0 0)} is VALID [2022-04-28 02:56:19,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {5982#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:19,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:19,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:19,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:19,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:19,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:19,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:19,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:19,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:19,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:19,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:19,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:19,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:19,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:19,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:19,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:19,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:19,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-28 02:56:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758689483] [2022-04-28 02:56:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758689483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003648586] [2022-04-28 02:56:19,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:19,384 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 02:56:19,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:19,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:56:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:19,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:19,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-28 02:56:19,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#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(12, 2); {5977#true} is VALID [2022-04-28 02:56:19,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-28 02:56:19,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-28 02:56:19,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-28 02:56:19,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6012#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:19,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {6012#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6012#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:19,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {6012#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:19,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:19,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:19,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:19,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:19,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:19,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:19,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:19,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:19,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:19,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:19,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:19,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:19,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:19,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:19,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:19,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:19,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:19,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:19,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-28 02:56:19,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-28 02:56:19,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-28 02:56:19,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-28 02:56:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:19,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:19,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-28 02:56:19,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-28 02:56:19,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-28 02:56:19,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-28 02:56:19,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-28 02:56:19,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {6176#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6172#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:19,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {6176#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6176#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:19,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {6183#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6176#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:19,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6183#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:19,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {6190#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6183#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:19,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {6190#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6190#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:19,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {6197#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6190#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:19,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {6197#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6197#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:19,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6197#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:19,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {6204#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6204#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:19,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6204#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:19,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6211#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:19,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {6218#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6211#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:19,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {6218#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6218#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:19,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {6225#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6218#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:19,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {6225#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6225#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:19,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {6232#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6225#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:19,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {6232#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6232#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:19,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {6239#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6232#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:19,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {6239#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6239#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:19,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6239#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:19,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-28 02:56:19,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-28 02:56:19,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-28 02:56:19,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#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(12, 2); {5977#true} is VALID [2022-04-28 02:56:19,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-28 02:56:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:19,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003648586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:19,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:19,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 02:56:19,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:19,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306274573] [2022-04-28 02:56:19,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306274573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:19,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:19,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:56:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657061212] [2022-04-28 02:56:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:19,982 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), 2 states have call successors, (3), 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 43 [2022-04-28 02:56:19,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:19,982 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:56:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:56:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-28 02:56:20,006 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,663 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2022-04-28 02:56:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:56:20,664 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), 2 states have call successors, (3), 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 43 [2022-04-28 02:56:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:20,664 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 02:56:20,665 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 02:56:20,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-28 02:56:20,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,761 INFO L225 Difference]: With dead ends: 110 [2022-04-28 02:56:20,761 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 02:56:20,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:56:20,761 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 198 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:20,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 37 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 02:56:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 46. [2022-04-28 02:56:20,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:20,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,825 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,825 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,826 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-28 02:56:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-28 02:56:20,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 02:56:20,827 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 02:56:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:20,828 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-28 02:56:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-28 02:56:20,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:20,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:20,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:20,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-28 02:56:20,829 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 43 [2022-04-28 02:56:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:20,829 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-28 02:56:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:20,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-28 02:56:20,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 02:56:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 02:56:20,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:20,881 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:20,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:21,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 02:56:21,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 23 times [2022-04-28 02:56:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193206535] [2022-04-28 02:56:21,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:21,103 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:21,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 24 times [2022-04-28 02:56:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:21,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096295790] [2022-04-28 02:56:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {6800#(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(12, 2); {6783#true} is VALID [2022-04-28 02:56:21,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-28 02:56:21,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-28 02:56:21,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:21,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {6800#(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(12, 2); {6783#true} is VALID [2022-04-28 02:56:21,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-28 02:56:21,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-28 02:56:21,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-28 02:56:21,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6788#(= main_~i~0 0)} is VALID [2022-04-28 02:56:21,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {6788#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6788#(= main_~i~0 0)} is VALID [2022-04-28 02:56:21,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {6788#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {6789#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {6789#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {6790#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {6790#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6791#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:21,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {6791#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6791#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:21,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {6791#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6792#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:21,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {6792#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6792#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:21,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {6792#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6793#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:21,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {6793#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6793#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:21,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {6793#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6794#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:21,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {6794#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6794#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:21,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {6794#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6795#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:21,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {6795#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6795#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:21,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {6795#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6796#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:21,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {6796#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6796#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:21,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {6796#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6797#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:21,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {6797#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6797#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:21,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {6797#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6798#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:21,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {6798#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6798#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:21,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {6798#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6799#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {6799#(<= main_~i~0 11)} assume !(~i~0 < 1024); {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {6784#false} ~i~0 := 0; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-28 02:56:21,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {6784#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {6784#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {6784#false} ~cond := #in~cond; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {6784#false} assume 0 == ~cond; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-28 02:56:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:21,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096295790] [2022-04-28 02:56:21,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096295790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:21,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684993249] [2022-04-28 02:56:21,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:21,296 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:21,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 02:56:21,373 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:21,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:21,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:21,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:21,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#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(12, 2); {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-28 02:56:21,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6891#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {6891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {6891#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {6891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6891#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {6891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6891#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:21,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {6891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {6789#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {6789#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {6789#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6789#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:21,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {6789#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {6790#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {6790#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {6790#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6790#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:21,559 INFO L272 TraceCheckUtils]: 41: Hoare triple {6790#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:21,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:21,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-28 02:56:21,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-28 02:56:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 02:56:21,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:21,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-28 02:56:21,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-28 02:56:21,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:21,721 INFO L272 TraceCheckUtils]: 41: Hoare triple {6948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:21,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {6948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6948#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:21,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {6948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6948#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:21,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {6948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {6948#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:21,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {6961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6948#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:21,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {6961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6961#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:21,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6961#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:21,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {6961#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:21,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {6974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6961#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:21,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {6974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6974#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:21,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {6974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6974#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:21,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {6974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {6974#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:21,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6974#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-28 02:56:21,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#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(12, 2); {6783#true} is VALID [2022-04-28 02:56:21,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-28 02:56:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-28 02:56:21,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684993249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:21,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:21,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-04-28 02:56:21,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193206535] [2022-04-28 02:56:21,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193206535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:21,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:21,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 02:56:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563364451] [2022-04-28 02:56:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 02:56:21,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:21,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:21,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:21,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 02:56:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 02:56:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:56:21,751 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:22,413 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-28 02:56:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 02:56:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 02:56:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-28 02:56:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-28 02:56:22,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 136 transitions. [2022-04-28 02:56:22,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:22,517 INFO L225 Difference]: With dead ends: 117 [2022-04-28 02:56:22,517 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 02:56:22,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=680, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 02:56:22,518 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:22,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 32 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 02:56:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 48. [2022-04-28 02:56:22,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:22,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,591 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,591 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:22,592 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-28 02:56:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-28 02:56:22,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:22,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:22,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:56:22,593 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-28 02:56:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:22,594 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-28 02:56:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-28 02:56:22,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:22,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:22,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:22,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-28 02:56:22,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 45 [2022-04-28 02:56:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:22,596 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-28 02:56:22,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:22,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-28 02:56:22,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-28 02:56:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 02:56:22,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:22,638 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:22,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 02:56:22,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 02:56:22,847 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 25 times [2022-04-28 02:56:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350685809] [2022-04-28 02:56:22,857 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:22,857 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:22,857 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 26 times [2022-04-28 02:56:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:22,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996759481] [2022-04-28 02:56:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:22,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:23,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {7648#(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(12, 2); {7630#true} is VALID [2022-04-28 02:56:23,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-28 02:56:23,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-28 02:56:23,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:23,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {7648#(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(12, 2); {7630#true} is VALID [2022-04-28 02:56:23,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-28 02:56:23,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-28 02:56:23,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-28 02:56:23,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7635#(= main_~i~0 0)} is VALID [2022-04-28 02:56:23,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {7635#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7635#(= main_~i~0 0)} is VALID [2022-04-28 02:56:23,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {7635#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:23,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:23,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:23,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:23,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:23,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:23,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:23,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:23,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:23,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:23,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:23,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:23,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:23,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:23,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:23,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:23,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:23,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:23,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:23,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-28 02:56:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:23,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996759481] [2022-04-28 02:56:23,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996759481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:23,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424782210] [2022-04-28 02:56:23,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:23,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:23,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:23,011 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:23,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 02:56:23,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:23,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:23,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 02:56:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:23,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:23,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-28 02:56:23,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#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(12, 2); {7630#true} is VALID [2022-04-28 02:56:23,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-28 02:56:23,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-28 02:56:23,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-28 02:56:23,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7667#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:23,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {7667#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7667#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:23,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {7667#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:23,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:23,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:23,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:23,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:23,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:23,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:23,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:23,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:23,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:23,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:23,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:23,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:23,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:23,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:23,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:23,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:23,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:23,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:23,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:23,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:23,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:23,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,250 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-28 02:56:23,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-28 02:56:23,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-28 02:56:23,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-28 02:56:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:23,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-28 02:56:23,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {7839#(< main_~i~0 1024)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-28 02:56:23,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7839#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:23,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7843#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:23,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {7850#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7843#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:23,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {7850#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7850#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:23,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {7857#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7850#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:23,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {7857#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7857#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:23,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {7864#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7857#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:23,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {7864#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7864#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:23,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {7871#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7864#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:23,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {7871#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7871#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:23,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {7878#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7871#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:23,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {7878#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7878#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:23,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {7885#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7878#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:23,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {7885#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7885#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:23,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {7892#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7885#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:23,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {7892#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7892#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:23,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {7899#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7892#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:23,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {7899#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7899#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:23,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {7906#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7899#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:23,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {7906#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7906#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:23,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {7913#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7906#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:23,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {7913#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7913#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:23,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {7920#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7913#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:23,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {7920#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7920#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:23,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7920#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:23,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-28 02:56:23,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-28 02:56:23,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-28 02:56:23,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#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(12, 2); {7630#true} is VALID [2022-04-28 02:56:23,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-28 02:56:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:23,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424782210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:23,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:23,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 02:56:23,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:23,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350685809] [2022-04-28 02:56:23,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350685809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:23,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:23,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:56:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717252180] [2022-04-28 02:56:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 02:56:23,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:23,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:23,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:23,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:56:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:23,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:56:23,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:56:23,670 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,457 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-28 02:56:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 02:56:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 02:56:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-28 02:56:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-28 02:56:24,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 145 transitions. [2022-04-28 02:56:24,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,569 INFO L225 Difference]: With dead ends: 124 [2022-04-28 02:56:24,569 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 02:56:24,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 02:56:24,570 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:24,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 42 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 02:56:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 50. [2022-04-28 02:56:24,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:24,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,628 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,628 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,629 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-28 02:56:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-28 02:56:24,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 02:56:24,630 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 02:56:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:24,631 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-28 02:56:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-28 02:56:24,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:24,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:24,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:24,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 02:56:24,633 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2022-04-28 02:56:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:24,633 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 02:56:24,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:24,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 02:56:24,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 02:56:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 02:56:24,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:24,688 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:24,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:24,901 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 27 times [2022-04-28 02:56:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:24,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689114591] [2022-04-28 02:56:24,905 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:24,905 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:24,905 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 28 times [2022-04-28 02:56:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:24,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266499081] [2022-04-28 02:56:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:24,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {8551#(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(12, 2); {8532#true} is VALID [2022-04-28 02:56:25,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-28 02:56:25,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-28 02:56:25,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:25,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#(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(12, 2); {8532#true} is VALID [2022-04-28 02:56:25,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-28 02:56:25,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-28 02:56:25,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-28 02:56:25,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8537#(= main_~i~0 0)} is VALID [2022-04-28 02:56:25,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {8537#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8537#(= main_~i~0 0)} is VALID [2022-04-28 02:56:25,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {8537#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-28 02:56:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:25,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266499081] [2022-04-28 02:56:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266499081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991608981] [2022-04-28 02:56:25,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:25,076 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:25,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 02:56:25,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:25,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:25,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 02:56:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:25,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:25,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-28 02:56:25,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#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(12, 2); {8532#true} is VALID [2022-04-28 02:56:25,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-28 02:56:25,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-28 02:56:25,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-28 02:56:25,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8570#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:25,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {8570#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8570#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:25,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {8570#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:25,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:25,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:25,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:25,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:25,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:25,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:25,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:25,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:25,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:25,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:25,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-28 02:56:25,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-28 02:56:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:25,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {8748#(< main_~i~0 1024)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-28 02:56:25,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {8752#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8748#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {8752#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8752#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {8759#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8752#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {8759#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8759#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:25,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {8766#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8759#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {8766#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8766#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {8773#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8766#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {8773#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8773#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:25,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {8780#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8773#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:25,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {8780#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8780#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8780#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8787#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {8794#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8787#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:25,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {8794#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8794#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:25,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {8801#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8794#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:25,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {8801#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8801#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:25,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {8808#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8801#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:25,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {8808#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8808#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:25,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {8815#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8808#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:25,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {8815#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8815#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:25,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {8822#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8815#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:25,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {8822#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8822#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:25,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {8829#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8822#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:25,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {8829#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8829#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:25,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {8836#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8829#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:25,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {8836#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8836#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:25,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8836#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:25,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-28 02:56:25,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-28 02:56:25,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-28 02:56:25,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#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(12, 2); {8532#true} is VALID [2022-04-28 02:56:25,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-28 02:56:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:25,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991608981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:25,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:25,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 02:56:25,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:25,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689114591] [2022-04-28 02:56:25,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689114591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:25,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:25,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:56:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424069082] [2022-04-28 02:56:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 02:56:25,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:25,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:25,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:25,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:56:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:25,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:56:25,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-28 02:56:25,689 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:26,469 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-28 02:56:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:56:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 02:56:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-28 02:56:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-28 02:56:26,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2022-04-28 02:56:26,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:26,549 INFO L225 Difference]: With dead ends: 131 [2022-04-28 02:56:26,549 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 02:56:26,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:56:26,550 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 348 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:26,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 27 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 02:56:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2022-04-28 02:56:26,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:26,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,614 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,614 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:26,616 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-28 02:56:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-28 02:56:26,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:26,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:26,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:56:26,616 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-28 02:56:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:26,618 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-28 02:56:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-28 02:56:26,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:26,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:26,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:26,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 02:56:26,619 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 49 [2022-04-28 02:56:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:26,619 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 02:56:26,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:26,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 02:56:26,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 02:56:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 02:56:26,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:26,707 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:26,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:26,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 02:56:26,922 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 29 times [2022-04-28 02:56:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:26,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264123550] [2022-04-28 02:56:26,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:26,926 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:26,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 30 times [2022-04-28 02:56:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:26,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730196807] [2022-04-28 02:56:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {9502#(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(12, 2); {9482#true} is VALID [2022-04-28 02:56:27,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-28 02:56:27,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-28 02:56:27,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:27,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {9502#(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(12, 2); {9482#true} is VALID [2022-04-28 02:56:27,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-28 02:56:27,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-28 02:56:27,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-28 02:56:27,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9487#(= main_~i~0 0)} is VALID [2022-04-28 02:56:27,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9487#(= main_~i~0 0)} is VALID [2022-04-28 02:56:27,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {9488#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {9488#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {9489#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {9489#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9490#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:27,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {9490#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9490#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:27,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {9490#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9491#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:27,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {9491#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9491#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:27,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {9491#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9492#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:27,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {9492#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9492#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:27,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {9492#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9493#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:27,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {9493#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9493#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:27,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {9493#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9494#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:27,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {9494#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9494#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:27,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {9494#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9495#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:27,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {9495#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9495#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:27,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {9495#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9496#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:27,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {9496#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9496#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:27,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {9496#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9497#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:27,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {9497#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9497#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:27,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {9497#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9498#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:27,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {9498#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9498#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:27,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {9498#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9499#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:27,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9499#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:27,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9500#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:27,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {9500#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9500#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {9500#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9501#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {9501#(<= main_~i~0 14)} assume !(~i~0 < 1024); {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {9483#false} ~i~0 := 0; {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-28 02:56:27,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {9483#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L272 TraceCheckUtils]: 47: Hoare triple {9483#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {9483#false} ~cond := #in~cond; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {9483#false} assume 0 == ~cond; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-28 02:56:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:27,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730196807] [2022-04-28 02:56:27,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730196807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:27,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143019281] [2022-04-28 02:56:27,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:27,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:27,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 02:56:27,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:27,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:27,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:27,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:27,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-28 02:56:27,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#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(12, 2); {9482#true} is VALID [2022-04-28 02:56:27,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-28 02:56:27,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-28 02:56:27,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-28 02:56:27,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-28 02:56:27,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9611#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:27,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {9611#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {9611#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:27,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {9611#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9611#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:27,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {9611#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9611#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:27,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {9611#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {9488#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {9488#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {9488#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9488#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:27,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {9488#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {9489#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {9489#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {9489#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9489#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:27,330 INFO L272 TraceCheckUtils]: 47: Hoare triple {9489#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:27,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:27,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-28 02:56:27,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-28 02:56:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 02:56:27,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:27,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-28 02:56:27,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-28 02:56:27,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:27,452 INFO L272 TraceCheckUtils]: 47: Hoare triple {9668#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:27,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {9668#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9668#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:27,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {9668#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9668#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:27,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {9668#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {9668#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:27,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9668#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:27,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9681#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:27,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {9681#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9681#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:27,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {9681#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {9681#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:27,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9681#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:27,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9694#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:27,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9694#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:27,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {9694#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {9694#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:27,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9694#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#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(12, 2); {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-28 02:56:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 02:56:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143019281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:27,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:27,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 24 [2022-04-28 02:56:27,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:27,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264123550] [2022-04-28 02:56:27,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264123550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:27,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:27,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:56:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931499024] [2022-04-28 02:56:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 02:56:27,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:27,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:27,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:27,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 02:56:27,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:27,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 02:56:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:56:27,481 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,137 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2022-04-28 02:56:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 02:56:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 02:56:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-28 02:56:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-28 02:56:28,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 163 transitions. [2022-04-28 02:56:28,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:28,274 INFO L225 Difference]: With dead ends: 138 [2022-04-28 02:56:28,274 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 02:56:28,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=532, Invalid=950, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 02:56:28,275 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 275 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:28,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 37 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 02:56:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 54. [2022-04-28 02:56:28,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:28,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,366 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,366 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,368 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 02:56:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 02:56:28,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:28,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:28,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 02:56:28,369 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 02:56:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:28,370 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 02:56:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 02:56:28,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:28,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:28,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:28,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-28 02:56:28,372 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 51 [2022-04-28 02:56:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:28,372 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-28 02:56:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:28,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-28 02:56:28,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 02:56:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 02:56:28,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:28,431 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:28,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:28,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 02:56:28,642 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 31 times [2022-04-28 02:56:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334522009] [2022-04-28 02:56:28,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:28,646 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:28,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 32 times [2022-04-28 02:56:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:28,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162216672] [2022-04-28 02:56:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {10491#(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(12, 2); {10470#true} is VALID [2022-04-28 02:56:28,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-28 02:56:28,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-28 02:56:28,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:28,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {10491#(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(12, 2); {10470#true} is VALID [2022-04-28 02:56:28,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-28 02:56:28,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-28 02:56:28,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-28 02:56:28,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10475#(= main_~i~0 0)} is VALID [2022-04-28 02:56:28,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {10475#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10475#(= main_~i~0 0)} is VALID [2022-04-28 02:56:28,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {10475#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:28,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:28,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:28,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:28,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:28,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:28,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:28,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:28,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:28,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:28,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:28,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:28,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:28,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:28,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:28,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:28,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:28,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:28,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:28,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:28,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:28,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:28,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:28,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:28,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:28,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:28,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:28,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-28 02:56:28,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-28 02:56:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:28,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:28,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162216672] [2022-04-28 02:56:28,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162216672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:28,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658713274] [2022-04-28 02:56:28,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:28,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:28,844 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:28,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 02:56:28,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:28,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:28,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 02:56:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:29,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-28 02:56:29,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#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(12, 2); {10470#true} is VALID [2022-04-28 02:56:29,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-28 02:56:29,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-28 02:56:29,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-28 02:56:29,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10510#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:29,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {10510#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10510#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:29,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {10510#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:29,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:29,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:29,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:29,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:29,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:29,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:29,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:29,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:29,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:29,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:29,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:29,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:29,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:29,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:29,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:29,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:29,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:29,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:29,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:29,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:29,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:29,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:29,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:29,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:29,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:29,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:29,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:29,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-28 02:56:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:29,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:29,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-28 02:56:29,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-28 02:56:29,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-28 02:56:29,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {10700#(< main_~i~0 1024)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-28 02:56:29,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {10704#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10700#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:29,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {10704#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10704#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:29,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {10711#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:29,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {10711#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10711#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:29,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {10718#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:29,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {10718#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10718#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:29,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {10725#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10718#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:29,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {10725#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10725#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:29,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {10732#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10725#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:29,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {10732#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10732#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:29,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {10739#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10732#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:29,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {10739#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10739#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:29,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {10746#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10739#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:29,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {10746#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10746#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:29,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {10753#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10746#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:29,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {10753#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10753#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:29,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {10760#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10753#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:29,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {10760#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10760#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:29,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {10767#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10760#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:29,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10767#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:29,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {10774#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10767#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:29,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {10774#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10774#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:29,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {10781#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10774#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:29,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {10781#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10781#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:29,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {10788#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10781#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:29,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {10788#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10788#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:29,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {10795#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10788#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:29,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {10795#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10795#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:29,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {10802#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10795#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:29,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {10802#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10802#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:29,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10802#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:29,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-28 02:56:29,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-28 02:56:29,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-28 02:56:29,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#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(12, 2); {10470#true} is VALID [2022-04-28 02:56:29,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-28 02:56:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:29,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658713274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:29,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 02:56:29,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:29,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334522009] [2022-04-28 02:56:29,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334522009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:29,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:56:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134023631] [2022-04-28 02:56:29,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 02:56:29,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:29,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:29,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:29,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:56:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:56:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:56:29,622 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,494 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-04-28 02:56:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 02:56:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 02:56:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-28 02:56:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-28 02:56:30,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 172 transitions. [2022-04-28 02:56:30,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:30,573 INFO L225 Difference]: With dead ends: 145 [2022-04-28 02:56:30,573 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 02:56:30,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 02:56:30,574 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 294 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:30,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 37 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 02:56:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 56. [2022-04-28 02:56:30,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:30,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,669 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,669 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,670 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-28 02:56:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-28 02:56:30,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-28 02:56:30,671 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-28 02:56:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,673 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-28 02:56:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-28 02:56:30,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:30,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 02:56:30,674 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 53 [2022-04-28 02:56:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:30,674 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 02:56:30,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:30,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 02:56:30,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 02:56:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 02:56:30,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:30,760 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:30,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 02:56:30,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:30,977 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 33 times [2022-04-28 02:56:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:30,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293099560] [2022-04-28 02:56:30,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:30,982 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:30,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 34 times [2022-04-28 02:56:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230844752] [2022-04-28 02:56:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {11538#(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(12, 2); {11516#true} is VALID [2022-04-28 02:56:31,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-28 02:56:31,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-28 02:56:31,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:31,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {11538#(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(12, 2); {11516#true} is VALID [2022-04-28 02:56:31,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-28 02:56:31,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-28 02:56:31,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-28 02:56:31,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11521#(= main_~i~0 0)} is VALID [2022-04-28 02:56:31,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {11521#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11521#(= main_~i~0 0)} is VALID [2022-04-28 02:56:31,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {11521#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:31,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:31,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:31,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:31,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:31,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:31,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:31,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:31,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:31,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:31,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:31,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:31,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:31,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:31,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:31,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:31,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:31,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:31,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:31,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:31,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:31,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:31,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:31,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:31,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:31,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:31,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:31,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:31,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:31,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:31,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:31,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-28 02:56:31,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-28 02:56:31,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-28 02:56:31,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-28 02:56:31,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-28 02:56:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230844752] [2022-04-28 02:56:31,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230844752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230057038] [2022-04-28 02:56:31,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:31,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:31,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:31,208 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:31,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 02:56:31,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:31,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:31,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 02:56:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:31,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-28 02:56:31,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#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(12, 2); {11516#true} is VALID [2022-04-28 02:56:31,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-28 02:56:31,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-28 02:56:31,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-28 02:56:31,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11557#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:31,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {11557#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11557#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:31,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {11557#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:31,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:31,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:31,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:31,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:31,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:31,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:31,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:31,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:31,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:31,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:31,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:31,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:31,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:31,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:31,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:31,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:31,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:31,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:31,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:31,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:31,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:31,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:31,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:31,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:31,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:31,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:31,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:31,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:31,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-28 02:56:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:31,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:32,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-28 02:56:32,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {11753#(< main_~i~0 1024)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-28 02:56:32,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {11757#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11753#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:32,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {11757#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11757#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:32,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {11764#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11757#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:32,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {11764#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11764#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:32,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {11771#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11764#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:32,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {11771#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11771#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:32,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {11778#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11771#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:32,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {11778#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11778#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:32,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {11785#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11778#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:32,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {11785#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11785#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:32,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {11792#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11785#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:32,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {11792#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11792#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:32,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {11799#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11792#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:32,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {11799#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11799#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:32,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {11806#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11799#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:32,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {11806#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11806#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:32,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {11813#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11806#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:32,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {11813#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11813#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:32,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {11820#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11813#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:32,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {11820#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11820#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:32,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {11827#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11820#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:32,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {11827#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11827#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:32,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {11834#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11827#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:32,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {11834#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11834#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:32,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {11841#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11834#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:32,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {11841#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11841#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:32,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {11848#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11841#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:32,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {11848#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11848#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:32,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {11855#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11848#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:32,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {11855#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11855#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:32,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {11862#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11855#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:32,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {11862#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11862#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:32,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11862#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:32,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-28 02:56:32,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-28 02:56:32,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-28 02:56:32,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#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(12, 2); {11516#true} is VALID [2022-04-28 02:56:32,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-28 02:56:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:32,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230057038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:32,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:32,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 02:56:32,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:32,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293099560] [2022-04-28 02:56:32,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293099560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:32,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:32,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:56:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862431143] [2022-04-28 02:56:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 02:56:32,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:32,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:32,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:32,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:56:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:56:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 02:56:32,188 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,113 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2022-04-28 02:56:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:56:33,114 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 02:56:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-28 02:56:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-28 02:56:33,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 181 transitions. [2022-04-28 02:56:33,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:33,207 INFO L225 Difference]: With dead ends: 152 [2022-04-28 02:56:33,207 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 02:56:33,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 02:56:33,209 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 329 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:33,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 37 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 02:56:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 58. [2022-04-28 02:56:33,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:33,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,294 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,303 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,305 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-28 02:56:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-28 02:56:33,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:33,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:33,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-28 02:56:33,306 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-28 02:56:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,308 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-28 02:56:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-28 02:56:33,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:33,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:33,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:33,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-28 02:56:33,310 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 55 [2022-04-28 02:56:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:33,310 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-28 02:56:33,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:33,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-28 02:56:33,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 02:56:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 02:56:33,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:33,387 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:33,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:33,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 35 times [2022-04-28 02:56:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:33,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575974381] [2022-04-28 02:56:33,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:33,602 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:33,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 36 times [2022-04-28 02:56:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:33,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781769099] [2022-04-28 02:56:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:33,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {12633#(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(12, 2); {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:33,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {12633#(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(12, 2); {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-28 02:56:33,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-28 02:56:33,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12615#(= main_~i~0 0)} is VALID [2022-04-28 02:56:33,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {12615#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12615#(= main_~i~0 0)} is VALID [2022-04-28 02:56:33,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {12615#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:33,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {12616#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:33,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {12616#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:33,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {12617#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:33,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {12617#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12618#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:33,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {12618#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12618#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:33,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {12618#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12619#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:33,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {12619#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12619#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:33,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {12619#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12620#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:33,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {12620#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12620#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {12620#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12621#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {12621#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12621#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:33,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {12621#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12622#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:33,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {12622#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12622#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:33,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {12622#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12623#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:33,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {12623#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12623#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:33,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {12623#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12624#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:33,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {12624#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12624#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:33,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {12624#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12625#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:33,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {12625#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12625#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:33,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {12625#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12626#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:33,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {12626#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12626#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:33,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {12626#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12627#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:33,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {12627#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12627#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:33,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {12627#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12628#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:33,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {12628#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12628#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:33,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {12628#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12629#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:33,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {12629#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12629#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:33,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {12629#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12630#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:33,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {12630#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12630#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:33,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {12630#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12631#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:33,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {12631#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12631#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {12631#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12632#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {12632#(<= main_~i~0 17)} assume !(~i~0 < 1024); {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {12611#false} ~i~0 := 0; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-28 02:56:33,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {12611#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L272 TraceCheckUtils]: 53: Hoare triple {12611#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {12611#false} ~cond := #in~cond; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {12611#false} assume 0 == ~cond; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-28 02:56:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781769099] [2022-04-28 02:56:33,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781769099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055572277] [2022-04-28 02:56:33,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:33,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:33,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:33,814 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:33,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 02:56:33,896 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:33,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:33,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:33,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:34,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#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(12, 2); {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12760#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {12760#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {12760#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:34,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {12760#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12760#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:34,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {12760#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12760#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:34,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {12760#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:34,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {12616#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:34,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {12616#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:34,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {12616#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12616#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:34,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {12616#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:34,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {12617#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:34,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {12617#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:34,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {12617#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12617#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:34,083 INFO L272 TraceCheckUtils]: 53: Hoare triple {12617#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:34,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:34,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-28 02:56:34,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-28 02:56:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-28 02:56:34,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:34,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-28 02:56:34,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-28 02:56:34,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:34,215 INFO L272 TraceCheckUtils]: 53: Hoare triple {12817#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:34,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {12817#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12817#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:34,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {12817#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12817#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:34,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {12817#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {12817#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:34,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {12830#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12817#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:34,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {12830#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12830#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:34,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {12830#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12830#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:34,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {12830#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {12830#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {12843#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12830#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {12843#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12843#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {12843#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12843#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {12843#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {12843#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12843#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#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(12, 2); {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-28 02:56:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-28 02:56:34,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055572277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:34,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2022-04-28 02:56:34,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:34,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575974381] [2022-04-28 02:56:34,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575974381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:34,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 02:56:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704706058] [2022-04-28 02:56:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 02:56:34,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:34,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:34,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:34,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 02:56:34,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 02:56:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2022-04-28 02:56:34,244 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:35,604 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2022-04-28 02:56:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 02:56:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 02:56:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-28 02:56:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-28 02:56:35,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 190 transitions. [2022-04-28 02:56:35,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:35,731 INFO L225 Difference]: With dead ends: 159 [2022-04-28 02:56:35,732 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 02:56:35,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=715, Invalid=1265, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 02:56:35,733 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 581 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:35,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 22 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 02:56:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2022-04-28 02:56:35,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:35,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,877 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,877 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:35,878 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-28 02:56:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-28 02:56:35,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:35,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:35,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-28 02:56:35,879 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-28 02:56:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:35,880 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-28 02:56:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-28 02:56:35,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:35,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:35,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:35,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-28 02:56:35,882 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 57 [2022-04-28 02:56:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:35,882 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-28 02:56:35,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:35,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-28 02:56:35,956 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-28 02:56:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 02:56:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 02:56:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:35,956 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:35,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:36,175 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 37 times [2022-04-28 02:56:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163062814] [2022-04-28 02:56:36,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:36,179 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:36,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 38 times [2022-04-28 02:56:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:36,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074126693] [2022-04-28 02:56:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {13763#(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(12, 2); {13739#true} is VALID [2022-04-28 02:56:36,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-28 02:56:36,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-28 02:56:36,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:36,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {13763#(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(12, 2); {13739#true} is VALID [2022-04-28 02:56:36,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-28 02:56:36,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-28 02:56:36,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-28 02:56:36,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13744#(= main_~i~0 0)} is VALID [2022-04-28 02:56:36,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {13744#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13744#(= main_~i~0 0)} is VALID [2022-04-28 02:56:36,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {13744#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:36,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:36,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:36,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:36,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:36,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:36,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:36,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:36,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:36,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:36,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:36,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:36,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:36,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:36,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:36,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:36,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:36,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:36,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:36,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:36,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:36,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:36,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:36,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:36,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:36,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:36,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:36,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:36,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:36,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:36,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:36,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:36,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:36,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:36,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:36,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-28 02:56:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:36,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074126693] [2022-04-28 02:56:36,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074126693] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:36,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552077794] [2022-04-28 02:56:36,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:36,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:36,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:36,398 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:36,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 02:56:36,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:36,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:36,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 02:56:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:36,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-28 02:56:36,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#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(12, 2); {13739#true} is VALID [2022-04-28 02:56:36,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-28 02:56:36,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-28 02:56:36,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-28 02:56:36,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13782#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:36,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {13782#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13782#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:36,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {13782#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:36,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:36,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:36,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:36,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:36,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:36,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:36,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:36,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:36,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:36,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:36,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:36,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:36,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:36,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:36,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:36,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:36,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:36,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:36,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:36,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:36,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:36,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:36,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:36,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:36,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:36,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:36,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:36,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:36,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:36,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:36,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:36,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:36,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:36,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-28 02:56:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:36,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:37,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-28 02:56:37,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-28 02:56:37,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {13990#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-28 02:56:37,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {13994#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:37,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {13994#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13994#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:37,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {14001#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13994#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:37,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {14001#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14001#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:37,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {14008#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14001#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:37,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {14008#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14008#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:37,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14008#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:37,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {14015#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14015#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:37,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {14022#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14015#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:37,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {14022#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14022#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:37,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {14029#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14022#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:37,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {14029#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14029#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:37,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {14036#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14029#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:37,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {14036#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14036#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:37,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {14043#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14036#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:37,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {14043#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14043#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:37,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {14050#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14043#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:37,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {14050#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14050#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:37,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {14057#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14050#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:37,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {14057#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14057#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:37,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {14064#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14057#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:37,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {14064#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14064#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:37,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {14071#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14064#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:37,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {14071#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14071#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:37,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {14078#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14071#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:37,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {14078#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14078#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:37,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {14085#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14078#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:37,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {14085#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14085#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:37,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {14092#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14085#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:37,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {14092#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14092#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:37,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {14099#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:37,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {14099#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14099#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:37,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {14106#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:37,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {14106#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14106#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:37,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {14113#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:37,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {14113#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14113#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:37,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14113#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:37,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-28 02:56:37,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-28 02:56:37,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-28 02:56:37,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#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(12, 2); {13739#true} is VALID [2022-04-28 02:56:37,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-28 02:56:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:37,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552077794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:37,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:37,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 02:56:37,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:37,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163062814] [2022-04-28 02:56:37,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163062814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:37,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:37,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 02:56:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513537083] [2022-04-28 02:56:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 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 59 [2022-04-28 02:56:37,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:37,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:37,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:37,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 02:56:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:37,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 02:56:37,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:56:37,338 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:38,720 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 02:56:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 02:56:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 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 59 [2022-04-28 02:56:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-28 02:56:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-28 02:56:38,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 199 transitions. [2022-04-28 02:56:38,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:38,850 INFO L225 Difference]: With dead ends: 166 [2022-04-28 02:56:38,850 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 02:56:38,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 02:56:38,852 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 394 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:38,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 42 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 02:56:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 62. [2022-04-28 02:56:39,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:39,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:39,013 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:39,013 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:39,015 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-28 02:56:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-28 02:56:39,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:39,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:39,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-28 02:56:39,015 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-28 02:56:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:39,017 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-28 02:56:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-28 02:56:39,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:39,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:39,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:39,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-28 02:56:39,018 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 59 [2022-04-28 02:56:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:39,019 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-28 02:56:39,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:39,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-28 02:56:39,093 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-28 02:56:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 02:56:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 02:56:39,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:39,094 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:39,116 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-28 02:56:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 02:56:39,307 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 39 times [2022-04-28 02:56:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193718909] [2022-04-28 02:56:39,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:39,311 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:39,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 40 times [2022-04-28 02:56:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:39,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349490915] [2022-04-28 02:56:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {14954#(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(12, 2); {14929#true} is VALID [2022-04-28 02:56:39,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-28 02:56:39,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-28 02:56:39,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:39,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {14954#(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(12, 2); {14929#true} is VALID [2022-04-28 02:56:39,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-28 02:56:39,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-28 02:56:39,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-28 02:56:39,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14934#(= main_~i~0 0)} is VALID [2022-04-28 02:56:39,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {14934#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14934#(= main_~i~0 0)} is VALID [2022-04-28 02:56:39,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {14934#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:39,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:39,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:39,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:39,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:39,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:39,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:39,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:39,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:39,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:39,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:39,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:39,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:39,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:39,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:39,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:39,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:39,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:39,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:39,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:39,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:39,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:39,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:39,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:39,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:39,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:39,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:39,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:39,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:39,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:39,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:39,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:39,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:39,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:39,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:39,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:39,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-28 02:56:39,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-28 02:56:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349490915] [2022-04-28 02:56:39,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349490915] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701241636] [2022-04-28 02:56:39,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:39,558 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:39,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 02:56:39,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:39,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:39,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:56:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:39,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:39,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-28 02:56:39,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#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(12, 2); {14929#true} is VALID [2022-04-28 02:56:39,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-28 02:56:39,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-28 02:56:39,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-28 02:56:39,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14973#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:39,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {14973#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14973#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:39,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {14973#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:39,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:39,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:39,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:39,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:39,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:39,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:39,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:39,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:39,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:39,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:39,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:39,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:39,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:39,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:39,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:39,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:39,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:39,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:39,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:39,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:39,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:39,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:39,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:39,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:39,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:39,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:39,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:39,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:39,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:39,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:39,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:39,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-28 02:56:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:39,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:40,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-28 02:56:40,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-28 02:56:40,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-28 02:56:40,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-28 02:56:40,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-28 02:56:40,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {15187#(< main_~i~0 1024)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-28 02:56:40,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {15191#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15187#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:40,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {15191#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15191#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:40,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {15198#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15191#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:40,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15198#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:40,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {15205#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15198#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:40,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {15205#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15205#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:40,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {15212#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15205#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:40,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {15212#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15212#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:40,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15212#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:40,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {15219#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15219#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:40,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {15226#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15219#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:40,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {15226#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15226#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:40,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {15233#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15226#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:40,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {15233#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15233#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:40,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {15240#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15233#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:40,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {15240#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15240#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:40,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {15247#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15240#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:40,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {15247#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15247#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:40,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {15254#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15247#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:40,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {15254#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15254#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:40,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {15261#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15254#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:40,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {15261#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15261#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:40,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {15268#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15261#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:40,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {15268#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15268#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:40,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {15275#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15268#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:40,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {15275#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15275#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:40,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {15282#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15275#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:40,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {15282#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15282#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:40,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {15289#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15282#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:40,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {15289#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15289#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:40,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15289#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:40,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {15296#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15296#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:40,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {15303#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15296#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:40,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {15303#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15303#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:40,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {15310#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15303#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:40,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {15310#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15310#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:40,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {15317#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15310#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:40,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {15317#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15317#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:40,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15317#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:40,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-28 02:56:40,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-28 02:56:40,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-28 02:56:40,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#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(12, 2); {14929#true} is VALID [2022-04-28 02:56:40,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-28 02:56:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701241636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:40,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:40,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 02:56:40,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193718909] [2022-04-28 02:56:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193718909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:40,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:40,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 02:56:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631189939] [2022-04-28 02:56:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 02:56:40,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:40,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:40,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:40,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 02:56:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 02:56:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 02:56:40,640 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,137 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2022-04-28 02:56:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:56:42,137 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 02:56:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-28 02:56:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-28 02:56:42,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 208 transitions. [2022-04-28 02:56:42,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:42,296 INFO L225 Difference]: With dead ends: 173 [2022-04-28 02:56:42,296 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 02:56:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 02:56:42,297 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 462 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:42,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 02:56:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 64. [2022-04-28 02:56:42,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:42,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,429 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,429 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,432 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-28 02:56:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-28 02:56:42,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:42,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:42,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 02:56:42,432 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 02:56:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:42,434 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-28 02:56:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-28 02:56:42,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:42,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:42,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:42,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-04-28 02:56:42,436 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2022-04-28 02:56:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:42,437 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-04-28 02:56:42,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:42,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2022-04-28 02:56:42,510 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-28 02:56:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-04-28 02:56:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 02:56:42,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:42,511 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:42,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:42,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 02:56:42,727 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 41 times [2022-04-28 02:56:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855824344] [2022-04-28 02:56:42,731 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:42,731 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:42,731 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 42 times [2022-04-28 02:56:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710597010] [2022-04-28 02:56:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:42,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {16193#(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(12, 2); {16167#true} is VALID [2022-04-28 02:56:42,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-28 02:56:42,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-28 02:56:42,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:42,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {16193#(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(12, 2); {16167#true} is VALID [2022-04-28 02:56:42,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-28 02:56:42,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-28 02:56:42,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-28 02:56:42,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16172#(= main_~i~0 0)} is VALID [2022-04-28 02:56:42,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {16172#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16172#(= main_~i~0 0)} is VALID [2022-04-28 02:56:42,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {16172#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {16173#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:42,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {16173#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:42,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {16174#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:42,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16175#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:42,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16175#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:42,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {16175#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16176#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:42,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {16176#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16176#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:42,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {16176#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16177#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:42,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {16177#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16177#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:42,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {16177#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16178#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:42,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {16178#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16178#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:42,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {16178#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16179#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:42,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {16179#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16179#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:42,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {16179#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16180#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:42,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {16180#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16180#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:42,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16181#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:42,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {16181#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16181#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:42,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {16181#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16182#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:42,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {16182#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16182#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:42,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {16182#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16183#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:42,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {16183#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16183#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:42,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {16183#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16184#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:42,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {16184#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16184#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:42,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {16184#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16185#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:42,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {16185#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16185#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:42,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {16185#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16186#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:42,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {16186#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16186#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:42,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {16186#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16187#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:42,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {16187#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16187#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:42,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {16187#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16188#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:42,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {16188#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16188#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:42,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {16188#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16189#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:42,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {16189#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16189#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:42,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {16189#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16190#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:42,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {16190#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16190#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:42,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16191#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:42,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {16191#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16191#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {16191#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16192#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {16192#(<= main_~i~0 20)} assume !(~i~0 < 1024); {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {16168#false} ~i~0 := 0; {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-28 02:56:42,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {16168#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L272 TraceCheckUtils]: 59: Hoare triple {16168#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {16168#false} ~cond := #in~cond; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {16168#false} assume 0 == ~cond; {16168#false} is VALID [2022-04-28 02:56:42,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-28 02:56:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710597010] [2022-04-28 02:56:42,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710597010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589240771] [2022-04-28 02:56:42,991 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:43,008 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:43,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 02:56:43,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:43,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:43,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:43,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:43,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-28 02:56:43,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#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(12, 2); {16167#true} is VALID [2022-04-28 02:56:43,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-28 02:56:43,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-28 02:56:43,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-28 02:56:43,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-28 02:56:43,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16338#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:43,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {16338#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {16338#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:43,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {16338#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16338#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:43,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {16338#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16338#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:43,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {16338#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:43,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {16173#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:43,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {16173#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:43,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {16173#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16173#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:43,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {16173#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:43,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {16174#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:43,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {16174#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:43,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {16174#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16174#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:43,247 INFO L272 TraceCheckUtils]: 59: Hoare triple {16174#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:43,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:43,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-28 02:56:43,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-28 02:56:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-28 02:56:43,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:43,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-28 02:56:43,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-28 02:56:43,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:43,437 INFO L272 TraceCheckUtils]: 59: Hoare triple {16395#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:43,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {16395#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16395#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:43,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {16395#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16395#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:43,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {16395#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {16395#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:43,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16395#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:43,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {16408#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16408#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:43,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {16408#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16408#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:43,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {16408#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {16408#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:43,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {16421#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16408#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:43,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {16421#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16421#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {16421#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16421#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {16421#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {16421#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16421#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-28 02:56:43,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#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(12, 2); {16167#true} is VALID [2022-04-28 02:56:43,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-28 02:56:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-28 02:56:43,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589240771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:43,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:43,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 30 [2022-04-28 02:56:43,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:43,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855824344] [2022-04-28 02:56:43,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855824344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:43,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:43,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 02:56:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237231282] [2022-04-28 02:56:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 02:56:43,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:43,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:43,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:43,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 02:56:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 02:56:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:56:43,490 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:44,749 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-04-28 02:56:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 02:56:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 02:56:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-28 02:56:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-28 02:56:44,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 217 transitions. [2022-04-28 02:56:44,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:44,939 INFO L225 Difference]: With dead ends: 180 [2022-04-28 02:56:44,939 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 02:56:44,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=925, Invalid=1625, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 02:56:44,940 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 415 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:44,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 02:56:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 66. [2022-04-28 02:56:45,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:45,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,084 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,085 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,087 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 02:56:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 02:56:45,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-28 02:56:45,087 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-28 02:56:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:45,090 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 02:56:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 02:56:45,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:45,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:45,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:45,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-28 02:56:45,092 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 63 [2022-04-28 02:56:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:45,093 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-28 02:56:45,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:45,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-28 02:56:45,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 02:56:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 02:56:45,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:45,192 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:45,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:45,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:45,407 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 43 times [2022-04-28 02:56:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:45,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732290109] [2022-04-28 02:56:45,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:45,410 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:45,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 44 times [2022-04-28 02:56:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:45,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064795497] [2022-04-28 02:56:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {17464#(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(12, 2); {17437#true} is VALID [2022-04-28 02:56:45,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-28 02:56:45,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-28 02:56:45,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:45,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {17464#(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(12, 2); {17437#true} is VALID [2022-04-28 02:56:45,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-28 02:56:45,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-28 02:56:45,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-28 02:56:45,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17442#(= main_~i~0 0)} is VALID [2022-04-28 02:56:45,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {17442#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17442#(= main_~i~0 0)} is VALID [2022-04-28 02:56:45,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {17442#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:45,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:45,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:45,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:45,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:45,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:45,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:45,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:45,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:45,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:45,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:45,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:45,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:45,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:45,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:45,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:45,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:45,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:45,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:45,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:45,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:45,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:45,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:45,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:45,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:45,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:45,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:45,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:45,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:45,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:45,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:45,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:45,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:45,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:45,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:45,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:45,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:45,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:45,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:45,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:45,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:45,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-28 02:56:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064795497] [2022-04-28 02:56:45,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064795497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:45,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184200848] [2022-04-28 02:56:45,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:45,712 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:45,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 02:56:45,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:45,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:45,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 02:56:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:45,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:46,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-28 02:56:46,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#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(12, 2); {17437#true} is VALID [2022-04-28 02:56:46,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-28 02:56:46,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-28 02:56:46,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-28 02:56:46,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17483#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:46,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {17483#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17483#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:46,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {17483#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:46,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:46,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:46,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:46,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:46,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:46,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:46,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:46,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:46,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:46,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:46,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:46,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:46,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:46,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:46,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:46,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:46,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:46,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:46,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:46,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:46,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:46,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:46,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:46,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:46,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:46,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:46,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:46,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:46,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:46,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:46,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:46,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:46,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:46,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:46,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:46,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:46,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:46,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:46,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:46,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:46,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,196 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-28 02:56:46,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-28 02:56:46,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-28 02:56:46,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-28 02:56:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:46,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-28 02:56:46,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {17709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {17713#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17709#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {17713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17713#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {17720#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17713#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:46,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {17720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17720#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {17727#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17720#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {17727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17727#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {17734#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17727#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:46,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {17734#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17734#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {17741#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17734#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {17741#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17741#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {17748#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17741#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:46,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {17748#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17748#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {17755#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17748#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {17755#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17755#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {17762#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17755#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:46,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {17762#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17762#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {17769#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17762#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {17769#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17769#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {17776#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17769#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:46,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {17776#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17776#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {17783#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17776#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {17783#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17783#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {17790#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17783#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:46,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {17790#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17790#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {17797#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17790#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {17797#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17797#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {17804#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17797#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {17804#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17804#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:46,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {17811#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17804#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {17811#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17811#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {17818#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17811#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {17818#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17818#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:46,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {17825#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17818#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {17825#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17825#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {17832#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17825#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {17832#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17832#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:46,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {17839#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17832#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {17839#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17839#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {17846#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17839#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {17846#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17846#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:46,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {17853#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17846#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {17853#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17853#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17853#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:46,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-28 02:56:46,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-28 02:56:46,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#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(12, 2); {17437#true} is VALID [2022-04-28 02:56:46,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-28 02:56:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:46,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184200848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:46,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:46,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 02:56:46,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:46,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732290109] [2022-04-28 02:56:46,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732290109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:46,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:46,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 02:56:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665974169] [2022-04-28 02:56:46,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 02:56:46,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:46,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:46,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:46,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 02:56:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 02:56:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:56:46,847 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:48,225 INFO L93 Difference]: Finished difference Result 187 states and 235 transitions. [2022-04-28 02:56:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 02:56:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 02:56:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-28 02:56:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-28 02:56:48,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 226 transitions. [2022-04-28 02:56:48,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:48,396 INFO L225 Difference]: With dead ends: 187 [2022-04-28 02:56:48,396 INFO L226 Difference]: Without dead ends: 170 [2022-04-28 02:56:48,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 02:56:48,398 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 454 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:48,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 37 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-28 02:56:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 68. [2022-04-28 02:56:48,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:48,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,572 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,572 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:48,575 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-28 02:56:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-28 02:56:48,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:48,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:48,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-28 02:56:48,576 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states. [2022-04-28 02:56:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:48,577 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-28 02:56:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-28 02:56:48,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:48,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:48,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:48,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 02:56:48,579 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 65 [2022-04-28 02:56:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:48,579 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 02:56:48,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:48,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 02:56:48,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 02:56:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 02:56:48,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:48,672 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:48,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:48,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:48,887 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 45 times [2022-04-28 02:56:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:48,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277706527] [2022-04-28 02:56:48,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:48,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:48,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 46 times [2022-04-28 02:56:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:48,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4742453] [2022-04-28 02:56:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:49,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {18799#(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(12, 2); {18771#true} is VALID [2022-04-28 02:56:49,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-28 02:56:49,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-28 02:56:49,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:49,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {18799#(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(12, 2); {18771#true} is VALID [2022-04-28 02:56:49,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-28 02:56:49,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-28 02:56:49,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-28 02:56:49,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18776#(= main_~i~0 0)} is VALID [2022-04-28 02:56:49,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {18776#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18776#(= main_~i~0 0)} is VALID [2022-04-28 02:56:49,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {18776#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,202 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-28 02:56:49,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-28 02:56:49,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-28 02:56:49,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-28 02:56:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:49,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4742453] [2022-04-28 02:56:49,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4742453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:49,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060725698] [2022-04-28 02:56:49,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:49,211 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:49,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 02:56:49,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:49,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:49,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 02:56:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:49,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:49,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-28 02:56:49,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#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(12, 2); {18771#true} is VALID [2022-04-28 02:56:49,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-28 02:56:49,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-28 02:56:49,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-28 02:56:49,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18818#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:49,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {18818#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18818#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:49,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {18818#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:49,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:49,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:49,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:49,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:49,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:49,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:49,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:49,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:49,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:49,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:49,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:49,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:49,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:49,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:49,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:49,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:49,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:49,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:49,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:49,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:49,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:49,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-28 02:56:49,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-28 02:56:49,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-28 02:56:49,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-28 02:56:49,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-28 02:56:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:49,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:50,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {19050#(< main_~i~0 1024)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-28 02:56:50,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {19054#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19050#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:50,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {19054#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19054#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:50,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {19061#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19054#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:50,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {19061#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19061#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:50,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {19068#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19061#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:50,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19068#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:50,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {19075#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19068#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:50,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {19075#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19075#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:50,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {19082#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19075#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:50,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {19082#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19082#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:50,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {19089#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19082#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:50,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {19089#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19089#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:50,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {19096#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19089#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:50,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {19096#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19096#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:50,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {19103#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19096#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:50,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {19103#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19103#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:50,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {19110#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19103#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:50,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {19110#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19110#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:50,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {19117#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19110#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:50,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {19117#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19117#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:50,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {19124#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19117#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:50,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {19124#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19124#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:50,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {19131#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19124#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:50,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {19131#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19131#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:50,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {19138#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19131#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:50,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {19138#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19138#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:50,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {19145#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19138#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:50,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {19145#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19145#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:50,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {19152#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19145#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:50,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {19152#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19152#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:50,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {19159#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19152#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:50,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {19159#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19159#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:50,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {19166#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19159#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:50,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {19166#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19166#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:50,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {19173#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19166#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:50,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {19173#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19173#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:50,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {19180#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19173#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:50,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {19180#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19180#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:50,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {19187#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:50,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {19187#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19187#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:50,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19187#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:50,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19194#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:50,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {19201#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19194#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:50,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {19201#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19201#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:50,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19201#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:50,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-28 02:56:50,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-28 02:56:50,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-28 02:56:50,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#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(12, 2); {18771#true} is VALID [2022-04-28 02:56:50,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-28 02:56:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:50,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060725698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:50,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 02:56:50,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277706527] [2022-04-28 02:56:50,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277706527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:50,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 02:56:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069710130] [2022-04-28 02:56:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 02:56:50,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:50,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:50,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 02:56:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 02:56:50,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 02:56:50,517 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:51,980 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2022-04-28 02:56:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 02:56:51,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 02:56:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-28 02:56:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-28 02:56:51,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 235 transitions. [2022-04-28 02:56:52,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:52,161 INFO L225 Difference]: With dead ends: 194 [2022-04-28 02:56:52,161 INFO L226 Difference]: Without dead ends: 177 [2022-04-28 02:56:52,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 02:56:52,163 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 534 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:52,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 27 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-28 02:56:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 70. [2022-04-28 02:56:52,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:52,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,292 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,292 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:52,294 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-28 02:56:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-28 02:56:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:52,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:52,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 02:56:52,295 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 02:56:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:52,296 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-28 02:56:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-28 02:56:52,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:52,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:52,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:52,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-28 02:56:52,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 67 [2022-04-28 02:56:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:52,298 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-28 02:56:52,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:52,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-28 02:56:52,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-28 02:56:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 02:56:52,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:52,403 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:52,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:52,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 02:56:52,615 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 47 times [2022-04-28 02:56:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755045129] [2022-04-28 02:56:52,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:52,619 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:52,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 48 times [2022-04-28 02:56:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046243210] [2022-04-28 02:56:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:52,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {20182#(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(12, 2); {20153#true} is VALID [2022-04-28 02:56:52,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-28 02:56:52,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-28 02:56:52,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:52,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#(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(12, 2); {20153#true} is VALID [2022-04-28 02:56:52,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-28 02:56:52,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-28 02:56:52,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-28 02:56:52,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20158#(= main_~i~0 0)} is VALID [2022-04-28 02:56:52,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {20158#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20158#(= main_~i~0 0)} is VALID [2022-04-28 02:56:52,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {20158#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:52,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {20159#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:52,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {20159#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:52,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {20160#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:52,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {20160#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20161#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:52,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20161#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:52,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {20161#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20162#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:52,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {20162#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20162#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:52,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {20162#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20163#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:52,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {20163#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20163#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:52,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {20163#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20164#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:52,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {20164#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20164#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:52,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {20164#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20165#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:52,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {20165#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20165#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:52,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {20165#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20166#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:52,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20166#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:52,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20167#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:52,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {20167#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20167#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:52,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {20167#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20168#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:52,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {20168#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20168#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:52,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {20168#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20169#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:52,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {20169#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20169#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:52,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {20169#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20170#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:52,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {20170#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20170#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:52,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {20170#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20171#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:52,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {20171#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20171#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:52,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {20171#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20172#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:52,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {20172#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20172#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:52,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {20172#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20173#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:52,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {20173#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20173#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:52,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {20173#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20174#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:52,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {20174#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20174#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:52,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {20174#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20175#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:52,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {20175#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20175#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:52,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {20175#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20176#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:52,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {20176#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20176#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:52,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {20176#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20177#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:52,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {20177#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20177#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:52,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {20177#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20178#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:52,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {20178#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20178#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:52,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {20178#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20179#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:52,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {20179#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20179#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:52,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {20179#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20180#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:52,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {20180#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20180#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {20180#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20181#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {20181#(<= main_~i~0 23)} assume !(~i~0 < 1024); {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {20154#false} ~i~0 := 0; {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-28 02:56:52,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {20154#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L272 TraceCheckUtils]: 65: Hoare triple {20154#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {20154#false} ~cond := #in~cond; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {20154#false} assume 0 == ~cond; {20154#false} is VALID [2022-04-28 02:56:52,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-28 02:56:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:52,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046243210] [2022-04-28 02:56:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046243210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:52,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610703620] [2022-04-28 02:56:52,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:52,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:52,956 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:52,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 02:56:53,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:56:53,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:56:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:53,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:53,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#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(12, 2); {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-28 02:56:53,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20345#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {20345#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {20345#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {20345#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20345#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {20345#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20345#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:53,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {20345#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {20159#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {20159#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {20159#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20159#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:53,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {20159#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {20160#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {20160#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {20160#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20160#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:53,299 INFO L272 TraceCheckUtils]: 65: Hoare triple {20160#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:53,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:53,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-28 02:56:53,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-28 02:56:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-28 02:56:53,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:53,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-28 02:56:53,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-28 02:56:53,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:56:53,530 INFO L272 TraceCheckUtils]: 65: Hoare triple {20402#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:53,531 INFO L290 TraceCheckUtils]: 64: Hoare triple {20402#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20402#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:53,531 INFO L290 TraceCheckUtils]: 63: Hoare triple {20402#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20402#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:53,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {20402#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {20402#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:53,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {20415#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20402#(<= main_~i~0 512)} is VALID [2022-04-28 02:56:53,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {20415#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20415#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:53,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {20415#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20415#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:53,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {20415#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {20415#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:53,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {20428#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20415#(<= main_~i~0 511)} is VALID [2022-04-28 02:56:53,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {20428#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20428#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {20428#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20428#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {20428#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {20428#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20428#(<= main_~i~0 510)} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#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(12, 2); {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-28 02:56:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-28 02:56:53,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610703620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:53,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:53,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 33 [2022-04-28 02:56:53,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:53,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755045129] [2022-04-28 02:56:53,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755045129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:53,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:53,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 02:56:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030172687] [2022-04-28 02:56:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 02:56:53,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:53,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:53,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 02:56:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 02:56:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 02:56:53,571 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:55,112 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2022-04-28 02:56:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 02:56:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 02:56:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-28 02:56:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-28 02:56:55,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 244 transitions. [2022-04-28 02:56:55,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:55,251 INFO L225 Difference]: With dead ends: 201 [2022-04-28 02:56:55,251 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 02:56:55,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1162, Invalid=2030, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 02:56:55,253 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 549 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:55,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 27 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 02:56:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 72. [2022-04-28 02:56:55,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:55,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,474 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,474 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:55,476 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-28 02:56:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-28 02:56:55,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:55,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:55,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-28 02:56:55,477 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-28 02:56:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:55,479 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-28 02:56:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-28 02:56:55,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:55,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:55,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:55,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-04-28 02:56:55,480 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 69 [2022-04-28 02:56:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:55,480 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-04-28 02:56:55,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:55,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2022-04-28 02:56:55,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-28 02:56:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 02:56:55,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:55,577 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:55,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:55,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 02:56:55,779 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 49 times [2022-04-28 02:56:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:55,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709400420] [2022-04-28 02:56:55,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:55,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:55,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 50 times [2022-04-28 02:56:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171343357] [2022-04-28 02:56:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {21594#(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(12, 2); {21564#true} is VALID [2022-04-28 02:56:56,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-28 02:56:56,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-28 02:56:56,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:56,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {21594#(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(12, 2); {21564#true} is VALID [2022-04-28 02:56:56,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-28 02:56:56,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-28 02:56:56,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-28 02:56:56,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21569#(= main_~i~0 0)} is VALID [2022-04-28 02:56:56,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {21569#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21569#(= main_~i~0 0)} is VALID [2022-04-28 02:56:56,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {21569#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:56,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:56,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:56,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:56,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:56,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:56,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:56,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:56,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:56,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:56,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:56,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:56,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:56,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:56,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:56,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:56,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:56,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:56,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:56,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:56,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:56,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:56,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:56,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:56,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:56,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:56,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:56,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:56,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:56,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:56,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:56,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:56,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:56,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:56,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:56,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:56,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:56,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:56,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:56,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:56,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:56,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:56,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:56,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:56,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-28 02:56:56,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-28 02:56:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171343357] [2022-04-28 02:56:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171343357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420383383] [2022-04-28 02:56:56,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:56,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:56,130 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:56,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 02:56:56,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:56,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:56,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 02:56:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:56,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:56,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-28 02:56:56,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#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(12, 2); {21564#true} is VALID [2022-04-28 02:56:56,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-28 02:56:56,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-28 02:56:56,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-28 02:56:56,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21613#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:56,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {21613#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21613#(<= main_~i~0 0)} is VALID [2022-04-28 02:56:56,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {21613#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:56,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:56,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:56,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:56,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:56,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:56,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:56,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:56,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:56,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:56,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:56,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:56,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:56,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:56,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:56,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:56,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:56,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:56,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:56,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:56,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:56,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:56,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:56,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:56,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:56,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:56,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:56,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:56,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:56,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:56,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:56,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:56,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:56,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:56,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:56,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:56,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:56,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:56,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:56,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:56,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:56,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:56,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:56,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:56,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:56,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-28 02:56:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:56,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:57,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {21857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-28 02:56:57,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {21861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21857#(< main_~i~0 1024)} is VALID [2022-04-28 02:56:57,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {21861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21861#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:57,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {21868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21861#(< main_~i~0 1023)} is VALID [2022-04-28 02:56:57,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {21868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21868#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:57,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {21875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21868#(< main_~i~0 1022)} is VALID [2022-04-28 02:56:57,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {21875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21875#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:57,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {21882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21875#(< main_~i~0 1021)} is VALID [2022-04-28 02:56:57,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {21882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21882#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:57,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {21889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21882#(< main_~i~0 1020)} is VALID [2022-04-28 02:56:57,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {21889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21889#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:57,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {21896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21889#(< main_~i~0 1019)} is VALID [2022-04-28 02:56:57,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {21896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21896#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:57,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {21903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21896#(< main_~i~0 1018)} is VALID [2022-04-28 02:56:57,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {21903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21903#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:57,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {21910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21903#(< main_~i~0 1017)} is VALID [2022-04-28 02:56:57,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {21910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21910#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:57,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {21917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21910#(< main_~i~0 1016)} is VALID [2022-04-28 02:56:57,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {21917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21917#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:57,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {21924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21917#(< main_~i~0 1015)} is VALID [2022-04-28 02:56:57,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {21924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21924#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:57,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {21931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21924#(< main_~i~0 1014)} is VALID [2022-04-28 02:56:57,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {21931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21931#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:57,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {21938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21931#(< main_~i~0 1013)} is VALID [2022-04-28 02:56:57,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {21938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21938#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:57,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {21945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21938#(< main_~i~0 1012)} is VALID [2022-04-28 02:56:57,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {21945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21945#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:57,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {21952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21945#(< main_~i~0 1011)} is VALID [2022-04-28 02:56:57,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {21952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21952#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:57,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {21959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21952#(< main_~i~0 1010)} is VALID [2022-04-28 02:56:57,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {21959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21959#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:57,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {21966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21959#(< main_~i~0 1009)} is VALID [2022-04-28 02:56:57,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {21966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21966#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:57,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {21973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21966#(< main_~i~0 1008)} is VALID [2022-04-28 02:56:57,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {21973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21973#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:57,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21973#(< main_~i~0 1007)} is VALID [2022-04-28 02:56:57,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21980#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:57,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {21987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21980#(< main_~i~0 1006)} is VALID [2022-04-28 02:56:57,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {21987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21987#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:57,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {21994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21987#(< main_~i~0 1005)} is VALID [2022-04-28 02:56:57,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {21994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21994#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:57,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {22001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21994#(< main_~i~0 1004)} is VALID [2022-04-28 02:56:57,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {22001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22001#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:57,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {22008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22001#(< main_~i~0 1003)} is VALID [2022-04-28 02:56:57,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {22008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22008#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:57,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {22015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22008#(< main_~i~0 1002)} is VALID [2022-04-28 02:56:57,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {22015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22015#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:57,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {22022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22015#(< main_~i~0 1001)} is VALID [2022-04-28 02:56:57,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {22022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22022#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:57,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22022#(< main_~i~0 1000)} is VALID [2022-04-28 02:56:57,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-28 02:56:57,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-28 02:56:57,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-28 02:56:57,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#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(12, 2); {21564#true} is VALID [2022-04-28 02:56:57,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-28 02:56:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:57,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420383383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:57,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:57,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 02:56:57,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:57,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709400420] [2022-04-28 02:56:57,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709400420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:57,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:57,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 02:56:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747229327] [2022-04-28 02:56:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 02:56:57,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:57,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:57,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:57,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 02:56:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 02:56:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:56:57,199 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:58,793 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2022-04-28 02:56:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:56:58,793 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 02:56:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-28 02:56:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-28 02:56:58,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 253 transitions. [2022-04-28 02:56:58,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:58,964 INFO L225 Difference]: With dead ends: 208 [2022-04-28 02:56:58,964 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 02:56:58,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 02:56:58,965 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 498 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:58,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 42 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:56:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 02:56:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 74. [2022-04-28 02:56:59,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:59,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:59,122 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:59,122 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:59,124 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-28 02:56:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-28 02:56:59,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:59,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:59,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 02:56:59,124 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 02:56:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:59,126 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-28 02:56:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-28 02:56:59,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:59,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:59,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:59,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-04-28 02:56:59,127 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 71 [2022-04-28 02:56:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:59,127 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-04-28 02:56:59,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:59,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2022-04-28 02:56:59,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-04-28 02:56:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 02:56:59,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:59,212 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:59,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:59,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 02:56:59,428 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 51 times [2022-04-28 02:56:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:59,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1270403208] [2022-04-28 02:56:59,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:56:59,445 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:56:59,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:56:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 52 times [2022-04-28 02:56:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:59,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309146258] [2022-04-28 02:56:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:59,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {23073#(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(12, 2); {23042#true} is VALID [2022-04-28 02:56:59,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-28 02:56:59,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-28 02:56:59,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:59,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {23073#(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(12, 2); {23042#true} is VALID [2022-04-28 02:56:59,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-28 02:56:59,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-28 02:56:59,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-28 02:56:59,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23047#(= main_~i~0 0)} is VALID [2022-04-28 02:56:59,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {23047#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23047#(= main_~i~0 0)} is VALID [2022-04-28 02:56:59,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {23047#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:59,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-28 02:56:59,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:59,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-28 02:56:59,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:59,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-28 02:56:59,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:59,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-28 02:56:59,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:59,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-28 02:56:59,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:59,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-28 02:56:59,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:59,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-28 02:56:59,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:59,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-28 02:56:59,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:59,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-28 02:56:59,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:59,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-28 02:56:59,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:59,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-28 02:56:59,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:59,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-28 02:56:59,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:59,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-28 02:56:59,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:59,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-28 02:56:59,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:59,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-28 02:56:59,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:59,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-28 02:56:59,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:59,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-28 02:56:59,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:59,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-28 02:56:59,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:59,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-28 02:56:59,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:59,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-28 02:56:59,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:59,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-28 02:56:59,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:59,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-28 02:56:59,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:59,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-28 02:56:59,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:59,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:56:59,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-28 02:56:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:56:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:59,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309146258] [2022-04-28 02:56:59,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309146258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:59,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317373156] [2022-04-28 02:56:59,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:59,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:59,751 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 02:56:59,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:59,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:59,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 02:56:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:59,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:00,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-28 02:57:00,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#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(12, 2); {23042#true} is VALID [2022-04-28 02:57:00,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-28 02:57:00,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-28 02:57:00,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-28 02:57:00,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23092#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:00,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {23092#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23092#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:00,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {23092#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:00,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:00,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:00,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:00,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:00,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:00,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:00,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:00,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:00,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:00,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:00,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:00,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:00,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:00,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:00,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:00,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:00,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:00,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:00,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:00,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:00,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:00,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:00,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:00,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:00,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:00,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:00,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:00,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:00,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:00,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:00,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:00,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:00,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:00,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:00,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:00,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:00,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:00,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:00,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:00,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:00,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:00,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:00,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:00,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:00,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:00,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:00,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:00,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-28 02:57:00,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-28 02:57:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:00,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:01,100 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-28 02:57:01,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-28 02:57:01,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-28 02:57:01,100 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-28 02:57:01,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-28 02:57:01,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {23342#(< main_~i~0 1024)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-28 02:57:01,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {23346#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23342#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:01,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {23346#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23346#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:01,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {23353#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23346#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:01,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {23353#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23353#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:01,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {23360#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23353#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:01,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {23360#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23360#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:01,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {23367#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23360#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:01,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {23367#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23367#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:01,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {23374#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23367#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:01,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {23374#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23374#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:01,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {23381#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23374#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:01,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {23381#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23381#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:01,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {23388#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23381#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:01,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {23388#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23388#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:01,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {23395#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23388#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:01,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {23395#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23395#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:01,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {23402#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23395#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:01,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {23402#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23402#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:01,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {23409#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23402#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:01,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {23409#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23409#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:01,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {23416#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23409#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:01,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {23416#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23416#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:01,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {23423#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23416#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:01,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {23423#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23423#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:01,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {23430#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23423#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:01,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {23430#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23430#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:01,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {23437#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23430#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:01,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {23437#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23437#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:01,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {23444#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23437#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:01,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {23444#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23444#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:01,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {23451#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23444#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:01,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {23451#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23451#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:01,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {23458#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23451#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:01,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {23458#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23458#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:01,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {23465#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23458#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:01,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {23465#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23465#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:01,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {23472#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23465#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:01,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {23472#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23472#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:01,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {23479#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23472#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:01,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {23479#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23479#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:01,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {23486#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23479#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:01,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {23486#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23486#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:01,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {23493#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23486#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:01,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {23493#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23493#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:01,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {23500#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23493#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:01,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {23500#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23500#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:01,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {23507#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23500#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:01,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {23507#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23507#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:01,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {23514#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23507#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:01,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {23514#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23514#(< main_~i~0 999)} is VALID [2022-04-28 02:57:01,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23514#(< main_~i~0 999)} is VALID [2022-04-28 02:57:01,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-28 02:57:01,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-28 02:57:01,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-28 02:57:01,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#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(12, 2); {23042#true} is VALID [2022-04-28 02:57:01,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-28 02:57:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:01,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317373156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:01,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:01,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 02:57:01,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:01,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1270403208] [2022-04-28 02:57:01,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1270403208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:01,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:01,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 02:57:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882900516] [2022-04-28 02:57:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 02:57:01,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:01,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:01,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:01,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 02:57:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 02:57:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 02:57:01,152 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:02,902 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-04-28 02:57:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 02:57:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 02:57:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-28 02:57:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-28 02:57:02,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 262 transitions. [2022-04-28 02:57:03,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:03,021 INFO L225 Difference]: With dead ends: 215 [2022-04-28 02:57:03,021 INFO L226 Difference]: Without dead ends: 198 [2022-04-28 02:57:03,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 02:57:03,023 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 562 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:03,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 37 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-28 02:57:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 76. [2022-04-28 02:57:03,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:03,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,188 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,188 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:03,190 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-28 02:57:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-28 02:57:03,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:03,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:03,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 198 states. [2022-04-28 02:57:03,191 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 198 states. [2022-04-28 02:57:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:03,193 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-28 02:57:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-28 02:57:03,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:03,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:03,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:03,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-28 02:57:03,194 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 73 [2022-04-28 02:57:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:03,195 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-28 02:57:03,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:03,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-28 02:57:03,324 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-28 02:57:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-28 02:57:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 02:57:03,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:03,324 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:03,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:03,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 02:57:03,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 53 times [2022-04-28 02:57:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:03,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280626751] [2022-04-28 02:57:03,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:03,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:03,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 54 times [2022-04-28 02:57:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:03,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627782311] [2022-04-28 02:57:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:03,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {24600#(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(12, 2); {24568#true} is VALID [2022-04-28 02:57:03,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:03,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {24600#(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(12, 2); {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-28 02:57:03,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24573#(= main_~i~0 0)} is VALID [2022-04-28 02:57:03,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {24573#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24573#(= main_~i~0 0)} is VALID [2022-04-28 02:57:03,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {24573#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:03,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {24574#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:03,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {24574#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:03,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {24575#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:03,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {24575#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24576#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:03,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {24576#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24576#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:03,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {24576#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24577#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:03,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {24577#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24577#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:03,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {24577#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24578#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:03,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {24578#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24578#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:03,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {24578#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24579#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:03,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {24579#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24579#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:03,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {24579#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24580#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {24580#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24580#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {24580#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24581#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {24581#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24581#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:03,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {24581#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24582#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {24582#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24582#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {24582#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24583#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {24583#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24583#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:03,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {24583#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24584#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {24584#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24584#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {24584#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24585#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {24585#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24585#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:03,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {24585#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24586#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {24586#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24586#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {24586#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24587#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {24587#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24587#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:03,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {24587#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24588#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:03,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {24588#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24588#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:03,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {24588#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24589#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:03,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {24589#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24589#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {24589#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24590#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {24590#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24590#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {24590#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24591#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:03,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {24591#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24591#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {24591#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24592#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {24592#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24592#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {24592#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24593#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:03,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {24593#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24593#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {24593#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24594#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {24594#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24594#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {24594#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24595#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:03,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {24595#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24595#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {24595#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24596#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {24596#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24596#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {24596#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24597#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:03,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {24597#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24597#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:03,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {24597#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24598#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:03,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {24598#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24598#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:03,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {24598#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24599#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {24599#(<= main_~i~0 26)} assume !(~i~0 < 1024); {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {24569#false} ~i~0 := 0; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {24569#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-28 02:57:03,880 INFO L272 TraceCheckUtils]: 71: Hoare triple {24569#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24569#false} is VALID [2022-04-28 02:57:03,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {24569#false} ~cond := #in~cond; {24569#false} is VALID [2022-04-28 02:57:03,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {24569#false} assume 0 == ~cond; {24569#false} is VALID [2022-04-28 02:57:03,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-28 02:57:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:03,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627782311] [2022-04-28 02:57:03,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627782311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:03,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664026618] [2022-04-28 02:57:03,882 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:03,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:03,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:03,883 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:03,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 02:57:04,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:57:04,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:04,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:57:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:04,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:04,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#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(12, 2); {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-28 02:57:04,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-28 02:57:04,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24781#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:04,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {24781#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {24781#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:04,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {24781#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24781#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:04,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {24781#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24781#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:04,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {24781#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:04,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {24574#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:04,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {24574#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:04,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {24574#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24574#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:04,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {24574#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:04,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {24575#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:04,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {24575#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:04,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {24575#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24575#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:04,255 INFO L272 TraceCheckUtils]: 71: Hoare triple {24575#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:04,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:04,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-28 02:57:04,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-28 02:57:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-28 02:57:04,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:04,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-28 02:57:04,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-28 02:57:04,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:04,501 INFO L272 TraceCheckUtils]: 71: Hoare triple {24838#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:04,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {24838#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24838#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:04,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {24838#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24838#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:04,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {24838#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {24838#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:04,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {24851#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24838#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:04,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {24851#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24851#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:04,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {24851#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24851#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:04,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {24851#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {24851#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:04,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {24864#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24851#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:04,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {24864#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24864#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24864#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {24864#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24864#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#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(12, 2); {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-28 02:57:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-28 02:57:04,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664026618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:04,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 36 [2022-04-28 02:57:04,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280626751] [2022-04-28 02:57:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280626751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 02:57:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45745873] [2022-04-28 02:57:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 02:57:04,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:04,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:04,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 02:57:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 02:57:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=726, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:57:04,570 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,550 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2022-04-28 02:57:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 02:57:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 02:57:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-28 02:57:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-28 02:57:06,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 271 transitions. [2022-04-28 02:57:06,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,674 INFO L225 Difference]: With dead ends: 222 [2022-04-28 02:57:06,674 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 02:57:06,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1426, Invalid=2480, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 02:57:06,675 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:06,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 22 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 02:57:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 78. [2022-04-28 02:57:06,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:06,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,826 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,827 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,829 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-28 02:57:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-28 02:57:06,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-28 02:57:06,829 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-28 02:57:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,831 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-28 02:57:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-28 02:57:06,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:06,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-04-28 02:57:06,832 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 75 [2022-04-28 02:57:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:06,833 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-04-28 02:57:06,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2022-04-28 02:57:06,949 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-28 02:57:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-28 02:57:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 02:57:06,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:06,950 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:06,966 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-28 02:57:07,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:07,163 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 55 times [2022-04-28 02:57:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:07,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705345012] [2022-04-28 02:57:07,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:07,166 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:07,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 56 times [2022-04-28 02:57:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205697610] [2022-04-28 02:57:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:07,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {26153#(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(12, 2); {26120#true} is VALID [2022-04-28 02:57:07,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-28 02:57:07,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-28 02:57:07,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:07,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {26153#(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(12, 2); {26120#true} is VALID [2022-04-28 02:57:07,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-28 02:57:07,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-28 02:57:07,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-28 02:57:07,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26125#(= main_~i~0 0)} is VALID [2022-04-28 02:57:07,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {26125#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26125#(= main_~i~0 0)} is VALID [2022-04-28 02:57:07,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {26125#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:07,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:07,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:07,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:07,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:07,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:07,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:07,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:07,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:07,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:07,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:07,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-28 02:57:07,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-28 02:57:07,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-28 02:57:07,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-28 02:57:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:07,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:07,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205697610] [2022-04-28 02:57:07,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205697610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:07,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513877900] [2022-04-28 02:57:07,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:07,438 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:07,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 02:57:07,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:07,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:07,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 02:57:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:07,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:07,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-28 02:57:07,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#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(12, 2); {26120#true} is VALID [2022-04-28 02:57:07,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-28 02:57:07,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-28 02:57:07,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-28 02:57:07,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26172#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:07,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {26172#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26172#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:07,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {26172#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:07,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:07,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:07,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:07,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:07,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:07,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:07,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:07,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:07,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:07,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:07,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:07,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:07,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:07,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:07,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:08,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:08,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:08,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:08,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:08,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:08,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:08,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:08,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:08,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:08,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:08,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:08,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:08,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:08,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:08,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:08,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:08,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:08,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:08,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:08,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:08,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-28 02:57:08,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-28 02:57:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-28 02:57:08,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {26434#(< main_~i~0 1024)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-28 02:57:08,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {26438#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26434#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:08,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {26438#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26438#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:08,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {26445#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26438#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:08,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {26445#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26445#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:08,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {26452#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26445#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:08,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {26452#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26452#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:08,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {26459#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26452#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:08,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {26459#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26459#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:08,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {26466#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26459#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:08,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {26466#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26466#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:08,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {26473#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26466#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:08,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {26473#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26473#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:08,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {26480#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26473#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:08,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {26480#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26480#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:08,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {26487#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26480#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:08,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {26487#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26487#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:08,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {26494#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26487#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:08,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {26494#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26494#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:08,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {26501#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26494#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:08,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {26501#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26501#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:08,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {26508#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26501#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:08,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {26508#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26508#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:08,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {26515#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26508#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:08,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {26515#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26515#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:08,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {26522#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26515#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:08,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {26522#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26522#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:08,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {26529#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26522#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:08,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {26529#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26529#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:08,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {26536#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26529#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:08,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {26536#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26536#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:08,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {26543#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26536#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:08,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {26543#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26543#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:08,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {26550#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26543#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:08,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {26550#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26550#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:08,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {26557#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26550#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:08,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {26557#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26557#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:08,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {26564#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26557#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:08,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {26564#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26564#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:08,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {26571#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26564#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:08,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {26571#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26571#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:08,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {26578#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26571#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:08,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {26578#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26578#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:08,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {26585#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26578#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:08,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {26585#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26585#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:08,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {26592#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26585#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:08,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {26592#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26592#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:08,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {26599#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26592#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:08,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {26599#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26599#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:08,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {26606#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26599#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:08,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {26606#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26606#(< main_~i~0 999)} is VALID [2022-04-28 02:57:08,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {26613#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26606#(< main_~i~0 999)} is VALID [2022-04-28 02:57:08,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {26613#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26613#(< main_~i~0 998)} is VALID [2022-04-28 02:57:08,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {26620#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26613#(< main_~i~0 998)} is VALID [2022-04-28 02:57:08,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {26620#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26620#(< main_~i~0 997)} is VALID [2022-04-28 02:57:08,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26620#(< main_~i~0 997)} is VALID [2022-04-28 02:57:08,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-28 02:57:08,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-28 02:57:08,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-28 02:57:08,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#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(12, 2); {26120#true} is VALID [2022-04-28 02:57:08,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-28 02:57:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513877900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:08,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:08,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 02:57:08,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705345012] [2022-04-28 02:57:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705345012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:08,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:08,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 02:57:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548252787] [2022-04-28 02:57:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 02:57:08,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:08,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:08,905 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-28 02:57:08,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 02:57:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 02:57:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 02:57:08,906 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,273 INFO L93 Difference]: Finished difference Result 229 states and 289 transitions. [2022-04-28 02:57:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 02:57:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 02:57:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-28 02:57:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-28 02:57:11,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 280 transitions. [2022-04-28 02:57:11,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:11,428 INFO L225 Difference]: With dead ends: 229 [2022-04-28 02:57:11,428 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 02:57:11,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 02:57:11,429 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 692 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:11,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 37 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 02:57:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 80. [2022-04-28 02:57:11,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:11,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,624 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,624 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,627 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-28 02:57:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-28 02:57:11,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 02:57:11,627 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 02:57:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:11,629 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-28 02:57:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-28 02:57:11,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:11,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-28 02:57:11,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 77 [2022-04-28 02:57:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:11,631 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-28 02:57:11,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-28 02:57:11,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-28 02:57:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 02:57:11,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:11,767 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:11,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:11,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:11,983 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 57 times [2022-04-28 02:57:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044892441] [2022-04-28 02:57:11,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:11,988 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:11,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 58 times [2022-04-28 02:57:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:11,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649144392] [2022-04-28 02:57:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {27776#(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(12, 2); {27742#true} is VALID [2022-04-28 02:57:12,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-28 02:57:12,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-28 02:57:12,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:12,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {27776#(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(12, 2); {27742#true} is VALID [2022-04-28 02:57:12,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-28 02:57:12,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-28 02:57:12,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-28 02:57:12,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27747#(= main_~i~0 0)} is VALID [2022-04-28 02:57:12,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {27747#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27747#(= main_~i~0 0)} is VALID [2022-04-28 02:57:12,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {27747#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-28 02:57:12,338 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-28 02:57:12,339 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-28 02:57:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:12,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649144392] [2022-04-28 02:57:12,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649144392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:12,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443914335] [2022-04-28 02:57:12,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:12,348 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:12,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 02:57:12,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:12,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:12,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 02:57:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:12,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-28 02:57:12,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#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(12, 2); {27742#true} is VALID [2022-04-28 02:57:12,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-28 02:57:12,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-28 02:57:12,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-28 02:57:12,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27795#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:12,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {27795#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27795#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:12,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {27795#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:12,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:12,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:12,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:12,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:12,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:12,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:12,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:12,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:12,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:12,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:12,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:12,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:12,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:12,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:12,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:12,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:12,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:12,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:12,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:12,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:12,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:12,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:12,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:12,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:12,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:12,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:12,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:12,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-28 02:57:12,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-28 02:57:12,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-28 02:57:12,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-28 02:57:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:12,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:13,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-28 02:57:13,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-28 02:57:13,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-28 02:57:13,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-28 02:57:13,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-28 02:57:13,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {28063#(< main_~i~0 1024)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-28 02:57:13,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {28067#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28063#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:13,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {28067#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28067#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:13,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {28074#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28067#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:13,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {28074#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28074#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:13,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {28081#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28074#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:13,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {28081#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28081#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:13,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {28088#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28081#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:13,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {28088#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28088#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:13,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {28095#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28088#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:13,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {28095#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28095#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:13,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {28102#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28095#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:13,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {28102#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28102#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:13,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {28109#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28102#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:13,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {28109#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28109#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:13,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {28116#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28109#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:13,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {28116#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28116#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:13,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {28123#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28116#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:13,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {28123#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28123#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:13,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {28130#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28123#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:13,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {28130#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28130#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:13,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {28137#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28130#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:13,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {28137#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28137#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:13,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {28144#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28137#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:13,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {28144#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28144#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:13,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {28151#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28144#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:13,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {28151#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28151#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:13,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {28158#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28151#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:13,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {28158#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28158#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:13,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {28165#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28158#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:13,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {28165#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28165#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:13,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {28172#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28165#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:13,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {28172#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28172#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:13,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {28179#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28172#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:13,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {28179#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28179#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:13,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {28186#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28179#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:13,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {28186#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28186#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:13,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {28193#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28186#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:13,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {28193#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28193#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:13,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {28200#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28193#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:13,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {28200#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28200#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:13,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {28207#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28200#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:13,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {28207#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28207#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:13,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {28214#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28207#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:13,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {28214#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28214#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:13,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {28221#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:13,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {28221#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28221#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:13,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {28228#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:13,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {28228#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28228#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:13,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {28235#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:13,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {28235#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28235#(< main_~i~0 999)} is VALID [2022-04-28 02:57:13,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {28242#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(< main_~i~0 999)} is VALID [2022-04-28 02:57:13,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {28242#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28242#(< main_~i~0 998)} is VALID [2022-04-28 02:57:13,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(< main_~i~0 998)} is VALID [2022-04-28 02:57:13,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28249#(< main_~i~0 997)} is VALID [2022-04-28 02:57:13,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {28256#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28249#(< main_~i~0 997)} is VALID [2022-04-28 02:57:13,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {28256#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28256#(< main_~i~0 996)} is VALID [2022-04-28 02:57:13,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28256#(< main_~i~0 996)} is VALID [2022-04-28 02:57:13,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-28 02:57:13,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-28 02:57:13,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-28 02:57:13,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#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(12, 2); {27742#true} is VALID [2022-04-28 02:57:13,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-28 02:57:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443914335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:13,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:13,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 02:57:13,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044892441] [2022-04-28 02:57:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044892441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:13,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:13,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 02:57:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365461895] [2022-04-28 02:57:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 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 79 [2022-04-28 02:57:13,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:13,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,837 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-28 02:57:13,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 02:57:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:13,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 02:57:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 02:57:13,839 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,300 INFO L93 Difference]: Finished difference Result 236 states and 298 transitions. [2022-04-28 02:57:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 02:57:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 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 79 [2022-04-28 02:57:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-28 02:57:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-28 02:57:16,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 289 transitions. [2022-04-28 02:57:16,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:16,493 INFO L225 Difference]: With dead ends: 236 [2022-04-28 02:57:16,493 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 02:57:16,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 02:57:16,495 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 631 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:16,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 02:57:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 82. [2022-04-28 02:57:16,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:16,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,797 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,798 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,800 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-28 02:57:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-28 02:57:16,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:16,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:16,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-28 02:57:16,801 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-28 02:57:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:16,811 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-28 02:57:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-28 02:57:16,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:16,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:16,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:16,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-04-28 02:57:16,813 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 79 [2022-04-28 02:57:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:16,813 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-04-28 02:57:16,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:16,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2022-04-28 02:57:16,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-28 02:57:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 02:57:16,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:16,935 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:16,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 02:57:17,147 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 59 times [2022-04-28 02:57:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129499219] [2022-04-28 02:57:17,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:17,151 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:17,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 60 times [2022-04-28 02:57:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:17,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142983114] [2022-04-28 02:57:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {29447#(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(12, 2); {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:17,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {29447#(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(12, 2); {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-28 02:57:17,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-28 02:57:17,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29417#(= main_~i~0 0)} is VALID [2022-04-28 02:57:17,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {29417#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29417#(= main_~i~0 0)} is VALID [2022-04-28 02:57:17,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {29417#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {29418#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {29418#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {29419#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {29419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29420#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:17,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {29420#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29420#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:17,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {29420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29421#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:17,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {29421#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29421#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:17,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {29421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29422#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:17,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {29422#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29422#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:17,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {29422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29423#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:17,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {29423#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29423#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:17,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {29423#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29424#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:17,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {29424#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29424#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:17,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {29424#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29425#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:17,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {29425#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29425#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:17,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {29425#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29426#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:17,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {29426#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29426#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:17,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {29426#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29427#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:17,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {29427#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29427#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:17,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {29427#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29428#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:17,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {29428#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29428#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:17,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {29428#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29429#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:17,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {29429#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29429#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:17,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {29429#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29430#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:17,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {29430#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29430#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:17,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {29430#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29431#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:17,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {29431#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29431#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:17,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {29431#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29432#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:17,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {29432#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29432#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:17,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {29432#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29433#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:17,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {29433#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29433#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:17,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {29433#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29434#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:17,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {29434#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29434#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:17,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {29434#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29435#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:17,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {29435#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29435#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:17,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {29435#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29436#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:17,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {29436#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29436#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:17,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {29436#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29437#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:17,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {29437#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29437#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:17,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {29437#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29438#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:17,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {29438#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29438#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:17,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {29438#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29439#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:17,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {29439#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29439#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:17,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {29439#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29440#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:17,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {29440#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29440#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:17,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {29440#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29441#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:17,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {29441#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29441#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:17,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {29441#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29442#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:17,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {29442#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29442#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:17,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {29442#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29443#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:17,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {29443#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29443#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:17,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {29443#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29444#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:17,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {29444#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29444#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:17,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {29444#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29445#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:17,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {29445#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29445#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:17,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {29445#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29446#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {29446#(<= main_~i~0 29)} assume !(~i~0 < 1024); {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {29413#false} ~i~0 := 0; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 67: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 69: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 70: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 71: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-28 02:57:17,517 INFO L290 TraceCheckUtils]: 74: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L290 TraceCheckUtils]: 75: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {29413#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L272 TraceCheckUtils]: 77: Hoare triple {29413#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {29413#false} ~cond := #in~cond; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {29413#false} assume 0 == ~cond; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-28 02:57:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142983114] [2022-04-28 02:57:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142983114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000596597] [2022-04-28 02:57:17,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:17,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:17,520 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:17,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 02:57:17,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:57:17,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:17,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:57:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:17,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#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(12, 2); {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-28 02:57:17,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29646#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:17,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {29646#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {29646#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:17,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {29646#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29646#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:17,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {29646#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29646#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:17,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {29646#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {29418#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {29418#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {29418#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29418#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:17,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {29418#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {29419#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {29419#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {29419#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29419#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:17,921 INFO L272 TraceCheckUtils]: 77: Hoare triple {29419#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:17,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:17,921 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-28 02:57:17,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-28 02:57:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-28 02:57:17,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:18,116 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-28 02:57:18,116 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-28 02:57:18,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:18,117 INFO L272 TraceCheckUtils]: 77: Hoare triple {29703#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:18,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {29703#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29703#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:18,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {29703#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29703#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:18,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {29703#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {29703#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:18,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {29716#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29703#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:18,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {29716#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29716#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:18,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {29716#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29716#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:18,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {29716#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {29716#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:18,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {29729#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29716#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:18,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {29729#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29729#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 67: Hoare triple {29729#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29729#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {29729#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {29729#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29729#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#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(12, 2); {29412#true} is VALID [2022-04-28 02:57:18,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-28 02:57:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-28 02:57:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000596597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:18,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7, 7] total 39 [2022-04-28 02:57:18,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129499219] [2022-04-28 02:57:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129499219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 02:57:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740630078] [2022-04-28 02:57:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 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 81 [2022-04-28 02:57:18,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:18,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:18,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 02:57:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 02:57:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=846, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 02:57:18,166 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:20,576 INFO L93 Difference]: Finished difference Result 243 states and 307 transitions. [2022-04-28 02:57:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 02:57:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 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 81 [2022-04-28 02:57:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-28 02:57:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-28 02:57:20,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 298 transitions. [2022-04-28 02:57:20,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:20,804 INFO L225 Difference]: With dead ends: 243 [2022-04-28 02:57:20,804 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 02:57:20,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1717, Invalid=2975, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 02:57:20,805 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 650 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:20,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 42 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 02:57:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 84. [2022-04-28 02:57:21,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:21,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,140 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,140 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:21,142 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-28 02:57:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-28 02:57:21,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:21,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 02:57:21,143 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 02:57:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:21,145 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-28 02:57:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-28 02:57:21,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:21,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:21,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:21,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-28 02:57:21,147 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 81 [2022-04-28 02:57:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:21,147 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-28 02:57:21,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-28 02:57:21,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 02:57:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 02:57:21,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:21,299 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:21,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:21,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:21,515 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 61 times [2022-04-28 02:57:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:21,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863524073] [2022-04-28 02:57:21,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:21,519 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:21,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 62 times [2022-04-28 02:57:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:21,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905740184] [2022-04-28 02:57:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:21,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {31141#(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(12, 2); {31105#true} is VALID [2022-04-28 02:57:21,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-28 02:57:21,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-28 02:57:21,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:21,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#(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(12, 2); {31105#true} is VALID [2022-04-28 02:57:21,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-28 02:57:21,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-28 02:57:21,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-28 02:57:21,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31110#(= main_~i~0 0)} is VALID [2022-04-28 02:57:21,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {31110#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31110#(= main_~i~0 0)} is VALID [2022-04-28 02:57:21,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {31110#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:21,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:21,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:21,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:21,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:21,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:21,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:21,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:21,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:21,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:21,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:21,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:21,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:21,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:21,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:21,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:21,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:21,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:21,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:21,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:21,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:21,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:21,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:21,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:21,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:21,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:21,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:21,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:21,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:21,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:21,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:21,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:21,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:21,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:21,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:21,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:21,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:21,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:21,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:21,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:21,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:21,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:21,943 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:21,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:21,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:21,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:21,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:21,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:21,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:21,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:21,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:21,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:21,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:21,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:21,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:21,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:21,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:21,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:21,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:21,948 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-28 02:57:21,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-28 02:57:21,949 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-28 02:57:21,949 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-28 02:57:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905740184] [2022-04-28 02:57:21,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905740184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:21,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017155178] [2022-04-28 02:57:21,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:21,953 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:21,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 02:57:22,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:22,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:22,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 02:57:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:22,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-28 02:57:22,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#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(12, 2); {31105#true} is VALID [2022-04-28 02:57:22,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-28 02:57:22,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-28 02:57:22,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-28 02:57:22,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31160#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:22,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {31160#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31160#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:22,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {31160#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:22,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:22,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:22,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:22,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:22,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:22,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:22,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:22,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:22,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:22,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:22,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:22,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:22,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:22,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:22,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:22,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:22,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:22,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:22,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:22,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:22,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:22,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:22,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:22,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:22,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:22,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:22,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:22,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:22,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:22,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:22,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:22,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:22,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:22,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:22,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:22,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:22,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:22,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:22,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:22,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:22,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:22,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:22,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:22,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:22,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:22,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:22,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:22,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:22,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:22,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:22,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:22,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:22,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:22,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:22,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:22,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:22,748 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:22,748 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:22,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-28 02:57:22,749 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-28 02:57:22,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-28 02:57:22,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-28 02:57:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:22,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:24,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-28 02:57:24,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-28 02:57:24,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {31440#(< main_~i~0 1024)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-28 02:57:24,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {31444#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:24,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {31444#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31444#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:24,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {31451#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:24,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {31451#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31451#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:24,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {31458#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:24,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {31458#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31458#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:24,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {31465#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31458#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:24,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {31465#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31465#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:24,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {31472#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31465#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:24,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {31472#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31472#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:24,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {31479#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31472#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:24,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31479#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:24,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {31486#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31479#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:24,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {31486#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31486#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:24,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {31493#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31486#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:24,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {31493#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31493#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:24,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {31500#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31493#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:24,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {31500#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31500#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:24,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {31507#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31500#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:24,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {31507#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31507#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:24,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {31514#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31507#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:24,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {31514#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31514#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:24,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {31521#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31514#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:24,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {31521#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31521#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:24,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {31528#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31521#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:24,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {31528#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31528#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:24,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {31535#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31528#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:24,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {31535#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31535#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:24,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31535#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:24,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31542#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:24,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {31549#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31542#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:24,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {31549#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31549#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:24,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {31556#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31549#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:24,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {31556#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31556#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:24,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {31563#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31556#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:24,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {31563#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31563#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:24,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {31570#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31563#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:24,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {31570#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31570#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:24,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {31577#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31570#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:24,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {31577#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31577#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:24,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {31584#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31577#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:24,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {31584#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31584#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:24,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {31591#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31584#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:24,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {31591#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31591#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:24,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {31598#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31591#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:24,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31598#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:24,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {31605#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31598#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:24,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {31605#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31605#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:24,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {31612#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31605#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:24,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {31612#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31612#(< main_~i~0 999)} is VALID [2022-04-28 02:57:24,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31612#(< main_~i~0 999)} is VALID [2022-04-28 02:57:24,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31619#(< main_~i~0 998)} is VALID [2022-04-28 02:57:24,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {31626#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31619#(< main_~i~0 998)} is VALID [2022-04-28 02:57:24,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {31626#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31626#(< main_~i~0 997)} is VALID [2022-04-28 02:57:24,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {31633#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31626#(< main_~i~0 997)} is VALID [2022-04-28 02:57:24,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {31633#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31633#(< main_~i~0 996)} is VALID [2022-04-28 02:57:24,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {31640#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31633#(< main_~i~0 996)} is VALID [2022-04-28 02:57:24,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {31640#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31640#(< main_~i~0 995)} is VALID [2022-04-28 02:57:24,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {31647#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31640#(< main_~i~0 995)} is VALID [2022-04-28 02:57:24,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {31647#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31647#(< main_~i~0 994)} is VALID [2022-04-28 02:57:24,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31647#(< main_~i~0 994)} is VALID [2022-04-28 02:57:24,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-28 02:57:24,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-28 02:57:24,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-28 02:57:24,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#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(12, 2); {31105#true} is VALID [2022-04-28 02:57:24,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-28 02:57:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017155178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:24,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:24,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 02:57:24,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863524073] [2022-04-28 02:57:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863524073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:24,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:24,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 02:57:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077184958] [2022-04-28 02:57:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 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 83 [2022-04-28 02:57:24,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:24,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:24,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 02:57:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 02:57:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:57:24,126 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:26,925 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2022-04-28 02:57:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 02:57:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 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 83 [2022-04-28 02:57:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-28 02:57:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-28 02:57:26,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 307 transitions. [2022-04-28 02:57:27,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:27,075 INFO L225 Difference]: With dead ends: 250 [2022-04-28 02:57:27,075 INFO L226 Difference]: Without dead ends: 233 [2022-04-28 02:57:27,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 02:57:27,076 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 745 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:27,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 27 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:57:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-28 02:57:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 86. [2022-04-28 02:57:27,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:27,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,268 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,268 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:27,271 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-28 02:57:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-28 02:57:27,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:27,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:27,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-28 02:57:27,271 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-28 02:57:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:27,274 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-28 02:57:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-28 02:57:27,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:27,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:27,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:27,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-28 02:57:27,277 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 83 [2022-04-28 02:57:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:27,277 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-28 02:57:27,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-28 02:57:27,401 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-28 02:57:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 02:57:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 02:57:27,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:27,402 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:27,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 02:57:27,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:27,619 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 63 times [2022-04-28 02:57:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:27,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213920887] [2022-04-28 02:57:27,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:27,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:27,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 64 times [2022-04-28 02:57:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145683215] [2022-04-28 02:57:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:28,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {32908#(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(12, 2); {32871#true} is VALID [2022-04-28 02:57:28,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-28 02:57:28,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-28 02:57:28,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:28,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {32908#(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(12, 2); {32871#true} is VALID [2022-04-28 02:57:28,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-28 02:57:28,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-28 02:57:28,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-28 02:57:28,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32876#(= main_~i~0 0)} is VALID [2022-04-28 02:57:28,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {32876#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32876#(= main_~i~0 0)} is VALID [2022-04-28 02:57:28,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {32876#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:28,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:28,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:28,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:28,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:28,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:28,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:28,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:28,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:28,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:28,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:28,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:28,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:28,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:28,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:28,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:28,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:28,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:28,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:28,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:28,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:28,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:28,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:28,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:28,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:28,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:28,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:28,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:28,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:28,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:28,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:28,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:28,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:28,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:28,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:28,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:28,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:28,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:28,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:28,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:28,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:28,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:28,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:28,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:28,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:28,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:28,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:28,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:28,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:28,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:28,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:28,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:28,100 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:28,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:28,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:28,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:28,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:28,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:28,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:28,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-28 02:57:28,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-28 02:57:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:28,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145683215] [2022-04-28 02:57:28,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145683215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:28,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740497976] [2022-04-28 02:57:28,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:28,106 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:28,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 02:57:28,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:28,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:28,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 02:57:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:28,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:28,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-28 02:57:28,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#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(12, 2); {32871#true} is VALID [2022-04-28 02:57:28,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-28 02:57:28,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-28 02:57:28,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-28 02:57:28,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32927#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:28,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {32927#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32927#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:28,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {32927#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:28,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:28,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:28,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:28,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:28,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:28,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:28,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:28,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:28,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:28,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:28,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:28,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:28,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:28,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:28,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:28,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:28,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:28,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:28,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:28,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:28,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:28,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:28,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:28,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:28,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:28,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:28,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:28,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:28,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:28,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:28,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:28,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:28,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:28,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:28,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:28,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:28,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:28,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:28,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:28,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:28,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:28,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:28,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:28,770 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:28,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:28,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:28,771 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:28,771 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:28,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:28,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:28,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:28,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:28,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:28,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:28,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:28,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:28,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:28,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:28,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:28,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:28,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-28 02:57:28,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-28 02:57:28,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-28 02:57:28,777 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-28 02:57:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:28,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:29,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-28 02:57:29,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-28 02:57:29,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-28 02:57:29,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-28 02:57:29,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {33213#(< main_~i~0 1024)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-28 02:57:29,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {33217#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33213#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:29,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {33217#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33217#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:29,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {33224#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33217#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:29,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {33224#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33224#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:29,865 INFO L290 TraceCheckUtils]: 63: Hoare triple {33231#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33224#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:29,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {33231#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33231#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:29,865 INFO L290 TraceCheckUtils]: 61: Hoare triple {33238#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33231#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:29,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {33238#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33238#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:29,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {33245#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33238#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:29,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {33245#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33245#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:29,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {33252#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33245#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:29,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {33252#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33252#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:29,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {33259#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33252#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:29,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {33259#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33259#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:29,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {33266#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33259#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:29,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {33266#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33266#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:29,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {33273#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33266#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:29,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {33273#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33273#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:29,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {33280#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33273#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:29,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {33280#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33280#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:29,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {33287#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33280#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:29,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {33287#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33287#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:29,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {33294#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33287#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:29,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {33294#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33294#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:29,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {33301#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33294#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:29,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {33301#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33301#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:29,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {33308#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33301#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:29,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {33308#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33308#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:29,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {33315#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33308#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:29,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {33315#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33315#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:29,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {33322#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33315#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:29,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {33322#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33322#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:29,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {33329#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33322#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:29,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {33329#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33329#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:29,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {33336#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33329#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:29,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {33336#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33336#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:29,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {33343#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33336#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:29,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {33343#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33343#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:29,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {33350#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33343#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:29,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {33350#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33350#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:29,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {33357#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33350#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:29,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {33357#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33357#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:29,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {33364#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33357#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:29,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {33364#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33364#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:29,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {33371#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33364#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:29,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {33371#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33371#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:29,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {33378#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33371#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:29,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {33378#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33378#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:29,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {33385#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33378#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:29,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {33385#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33385#(< main_~i~0 999)} is VALID [2022-04-28 02:57:29,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {33392#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33385#(< main_~i~0 999)} is VALID [2022-04-28 02:57:29,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {33392#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33392#(< main_~i~0 998)} is VALID [2022-04-28 02:57:29,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {33399#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33392#(< main_~i~0 998)} is VALID [2022-04-28 02:57:29,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {33399#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33399#(< main_~i~0 997)} is VALID [2022-04-28 02:57:29,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {33406#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33399#(< main_~i~0 997)} is VALID [2022-04-28 02:57:29,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {33406#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33406#(< main_~i~0 996)} is VALID [2022-04-28 02:57:29,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {33413#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33406#(< main_~i~0 996)} is VALID [2022-04-28 02:57:29,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {33413#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33413#(< main_~i~0 995)} is VALID [2022-04-28 02:57:29,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {33420#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33413#(< main_~i~0 995)} is VALID [2022-04-28 02:57:29,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {33420#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33420#(< main_~i~0 994)} is VALID [2022-04-28 02:57:29,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {33427#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33420#(< main_~i~0 994)} is VALID [2022-04-28 02:57:29,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {33427#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33427#(< main_~i~0 993)} is VALID [2022-04-28 02:57:29,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33427#(< main_~i~0 993)} is VALID [2022-04-28 02:57:29,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-28 02:57:29,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-28 02:57:29,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-28 02:57:29,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#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(12, 2); {32871#true} is VALID [2022-04-28 02:57:29,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-28 02:57:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:29,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740497976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:29,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:29,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 02:57:29,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213920887] [2022-04-28 02:57:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213920887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:29,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:29,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 02:57:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689499646] [2022-04-28 02:57:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:29,895 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 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 85 [2022-04-28 02:57:29,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:29,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:29,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:29,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 02:57:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 02:57:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 02:57:29,928 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:33,383 INFO L93 Difference]: Finished difference Result 257 states and 325 transitions. [2022-04-28 02:57:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 02:57:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 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 85 [2022-04-28 02:57:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-28 02:57:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-28 02:57:33,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 316 transitions. [2022-04-28 02:57:33,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:33,619 INFO L225 Difference]: With dead ends: 257 [2022-04-28 02:57:33,619 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 02:57:33,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 02:57:33,620 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 856 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:33,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 37 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 02:57:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 88. [2022-04-28 02:57:33,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:33,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,883 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,883 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:33,886 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-28 02:57:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-28 02:57:33,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:33,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:33,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 02:57:33,886 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 02:57:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:33,889 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-28 02:57:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-28 02:57:33,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:33,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:33,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:33,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-04-28 02:57:33,890 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 85 [2022-04-28 02:57:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:33,890 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-04-28 02:57:33,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:33,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2022-04-28 02:57:34,020 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-28 02:57:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-28 02:57:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 02:57:34,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:34,020 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:34,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 02:57:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 02:57:34,235 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 65 times [2022-04-28 02:57:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:34,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [485789175] [2022-04-28 02:57:34,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:34,239 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:34,239 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 66 times [2022-04-28 02:57:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738864298] [2022-04-28 02:57:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:34,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {34723#(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(12, 2); {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:34,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {34723#(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(12, 2); {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-28 02:57:34,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-28 02:57:34,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34690#(= main_~i~0 0)} is VALID [2022-04-28 02:57:34,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {34690#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34690#(= main_~i~0 0)} is VALID [2022-04-28 02:57:34,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {34690#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:34,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {34691#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:34,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {34691#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:34,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {34692#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:34,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {34692#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34693#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:34,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {34693#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34693#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:34,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {34693#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34694#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:34,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {34694#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34694#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:34,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {34694#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34695#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:34,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {34695#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34695#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:34,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {34695#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34696#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:34,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {34696#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34696#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:34,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {34696#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34697#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:34,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {34697#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34697#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:34,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {34697#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34698#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:34,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {34698#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34698#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:34,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {34698#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34699#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:34,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {34699#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34699#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:34,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {34699#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34700#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:34,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {34700#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34700#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:34,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {34700#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34701#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:34,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {34701#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34701#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:34,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {34701#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34702#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:34,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {34702#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34702#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:34,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {34702#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34703#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:34,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {34703#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34703#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:34,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {34703#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34704#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:34,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {34704#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34704#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:34,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {34704#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34705#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:34,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {34705#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34705#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:34,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {34705#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34706#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:34,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {34706#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34706#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:34,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {34706#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34707#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:34,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {34707#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34707#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:34,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {34707#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34708#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:34,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {34708#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34708#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:34,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {34708#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34709#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:34,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {34709#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34709#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:34,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {34709#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34710#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:34,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {34710#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34710#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:34,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {34710#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34711#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:34,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {34711#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34711#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:34,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {34711#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34712#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:34,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {34712#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34712#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:34,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {34712#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34713#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:34,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {34713#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34713#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:34,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {34713#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34714#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:34,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {34714#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34714#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:34,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {34714#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34715#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:34,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {34715#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34715#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:34,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {34715#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34716#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:34,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {34716#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34716#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:34,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {34716#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34717#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:34,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {34717#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34717#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:34,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {34717#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34718#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:34,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {34718#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34718#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:34,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {34718#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34719#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:34,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {34719#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34719#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:34,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {34719#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34720#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:34,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {34720#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34720#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:34,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {34720#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34721#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:34,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {34721#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34721#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:34,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {34721#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34722#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {34722#(<= main_~i~0 32)} assume !(~i~0 < 1024); {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {34686#false} ~i~0 := 0; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 73: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 79: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L290 TraceCheckUtils]: 82: Hoare triple {34686#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-28 02:57:34,764 INFO L272 TraceCheckUtils]: 83: Hoare triple {34686#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34686#false} is VALID [2022-04-28 02:57:34,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {34686#false} ~cond := #in~cond; {34686#false} is VALID [2022-04-28 02:57:34,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {34686#false} assume 0 == ~cond; {34686#false} is VALID [2022-04-28 02:57:34,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-28 02:57:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738864298] [2022-04-28 02:57:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738864298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162755030] [2022-04-28 02:57:34,765 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:34,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:34,767 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 02:57:34,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:57:34,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:34,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:57:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:34,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:35,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#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(12, 2); {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-28 02:57:35,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {34940#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:35,194 INFO L290 TraceCheckUtils]: 72: Hoare triple {34940#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {34940#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:35,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {34940#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34940#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:35,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {34940#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34940#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:35,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {34940#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {34691#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34691#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:35,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {34691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,196 INFO L290 TraceCheckUtils]: 80: Hoare triple {34692#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {34692#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {34692#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34692#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:35,197 INFO L272 TraceCheckUtils]: 83: Hoare triple {34692#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:35,197 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:35,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-28 02:57:35,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-28 02:57:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-28 02:57:35,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:35,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-28 02:57:35,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-28 02:57:35,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:35,384 INFO L272 TraceCheckUtils]: 83: Hoare triple {34997#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:35,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {34997#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34997#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:35,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {34997#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34997#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:35,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {34997#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {34997#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:35,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {35010#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34997#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:35,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {35010#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35010#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:35,386 INFO L290 TraceCheckUtils]: 77: Hoare triple {35010#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35010#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:35,386 INFO L290 TraceCheckUtils]: 76: Hoare triple {35010#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {35010#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:35,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {35023#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {35010#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:35,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {35023#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35023#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {35023#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35023#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {35023#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {35023#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {35023#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-28 02:57:35,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#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(12, 2); {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-28 02:57:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-28 02:57:35,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162755030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:35,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:35,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7, 7] total 42 [2022-04-28 02:57:35,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:35,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [485789175] [2022-04-28 02:57:35,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [485789175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:35,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:35,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 02:57:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530814552] [2022-04-28 02:57:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 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 87 [2022-04-28 02:57:35,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:35,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:35,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:35,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 02:57:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 02:57:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=975, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:57:35,456 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:39,510 INFO L93 Difference]: Finished difference Result 264 states and 334 transitions. [2022-04-28 02:57:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 02:57:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 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 87 [2022-04-28 02:57:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-28 02:57:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-28 02:57:39,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 325 transitions. [2022-04-28 02:57:39,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:39,705 INFO L225 Difference]: With dead ends: 264 [2022-04-28 02:57:39,705 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 02:57:39,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2035, Invalid=3515, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 02:57:39,706 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:39,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 27 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 02:57:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 90. [2022-04-28 02:57:40,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:40,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,071 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,071 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,074 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-28 02:57:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-28 02:57:40,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 02:57:40,074 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 02:57:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:40,077 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-28 02:57:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-28 02:57:40,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:40,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:40,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:40,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-04-28 02:57:40,078 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2022-04-28 02:57:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:40,078 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-04-28 02:57:40,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:40,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2022-04-28 02:57:40,229 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-28 02:57:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-28 02:57:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 02:57:40,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:40,230 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:40,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:40,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 02:57:40,443 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 67 times [2022-04-28 02:57:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653904043] [2022-04-28 02:57:40,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:40,447 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:40,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 68 times [2022-04-28 02:57:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:40,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763789829] [2022-04-28 02:57:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:40,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {36558#(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(12, 2); {36519#true} is VALID [2022-04-28 02:57:40,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:40,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {36558#(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(12, 2); {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-28 02:57:40,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36524#(= main_~i~0 0)} is VALID [2022-04-28 02:57:40,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {36524#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36524#(= main_~i~0 0)} is VALID [2022-04-28 02:57:40,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {36524#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:40,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:40,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:40,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:40,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:40,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:40,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:40,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:40,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:40,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:40,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:40,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:40,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:40,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:40,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:40,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:40,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:40,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:40,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:40,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:40,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:40,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:40,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:40,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:40,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:40,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:40,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:40,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:40,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:40,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:40,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:40,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:40,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:40,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:40,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:40,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:40,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:40,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:40,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:40,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:40,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:40,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:40,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:40,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:40,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:40,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:40,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:40,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:40,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:40,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:40,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:40,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:40,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:40,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:40,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:40,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:40,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:40,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:40,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:40,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:40,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:40,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-28 02:57:40,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-28 02:57:40,866 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-28 02:57:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763789829] [2022-04-28 02:57:40,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763789829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102863878] [2022-04-28 02:57:40,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:57:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:40,868 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 02:57:41,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:57:41,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:41,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 02:57:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:41,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:41,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-28 02:57:41,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#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(12, 2); {36519#true} is VALID [2022-04-28 02:57:41,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-28 02:57:41,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-28 02:57:41,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-28 02:57:41,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36577#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:41,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {36577#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36577#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:41,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {36577#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:41,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:41,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:41,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:41,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:41,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:41,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:41,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:41,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:41,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:41,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:41,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:41,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:41,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:41,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:41,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:41,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:41,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:41,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:41,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:41,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:41,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:41,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:41,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:41,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:41,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:41,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:41,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:41,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:41,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:41,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:41,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:41,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:41,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:41,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:41,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:41,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:41,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:41,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:41,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:41,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:41,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-28 02:57:41,414 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-28 02:57:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:41,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:42,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {36875#(< main_~i~0 1024)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-28 02:57:42,881 INFO L290 TraceCheckUtils]: 71: Hoare triple {36879#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36875#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:42,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {36879#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36879#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:42,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {36886#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36879#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:42,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {36886#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36886#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:42,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {36893#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36886#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:42,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {36893#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36893#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:42,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {36900#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36893#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:42,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {36900#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36900#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:42,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {36907#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36900#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:42,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {36907#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36907#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:42,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {36914#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36907#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:42,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {36914#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36914#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:42,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {36921#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36914#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:42,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {36921#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36921#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:42,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {36928#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36921#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:42,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {36928#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36928#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:42,887 INFO L290 TraceCheckUtils]: 55: Hoare triple {36935#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36928#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:42,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {36935#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36935#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:42,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {36942#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36935#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:42,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {36942#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36942#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:42,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {36949#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36942#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:42,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {36949#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36949#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:42,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {36956#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36949#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:42,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {36956#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36956#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:42,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {36963#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36956#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:42,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {36963#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36963#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:42,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {36970#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36963#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:42,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {36970#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36970#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:42,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {36977#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36970#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:42,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {36977#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36977#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:42,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {36984#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36977#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:42,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {36984#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36984#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:42,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {36991#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36984#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:42,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {36991#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36991#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:42,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {36998#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36991#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:42,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {36998#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36998#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:42,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {37005#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36998#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:42,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {37005#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37005#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:42,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {37012#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37005#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:42,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {37012#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37012#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:42,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {37019#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37012#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:42,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {37019#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37019#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:42,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {37026#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37019#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:42,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {37026#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37026#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:42,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {37033#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37026#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:42,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {37033#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37033#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:42,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {37040#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37033#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:42,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {37040#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37040#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:42,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {37047#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37040#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:42,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {37047#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37047#(< main_~i~0 999)} is VALID [2022-04-28 02:57:42,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {37054#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37047#(< main_~i~0 999)} is VALID [2022-04-28 02:57:42,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {37054#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37054#(< main_~i~0 998)} is VALID [2022-04-28 02:57:42,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {37061#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37054#(< main_~i~0 998)} is VALID [2022-04-28 02:57:42,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {37061#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37061#(< main_~i~0 997)} is VALID [2022-04-28 02:57:42,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {37068#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37061#(< main_~i~0 997)} is VALID [2022-04-28 02:57:42,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {37068#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37068#(< main_~i~0 996)} is VALID [2022-04-28 02:57:42,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {37075#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37068#(< main_~i~0 996)} is VALID [2022-04-28 02:57:42,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {37075#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37075#(< main_~i~0 995)} is VALID [2022-04-28 02:57:42,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {37082#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37075#(< main_~i~0 995)} is VALID [2022-04-28 02:57:42,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {37082#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37082#(< main_~i~0 994)} is VALID [2022-04-28 02:57:42,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {37089#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37082#(< main_~i~0 994)} is VALID [2022-04-28 02:57:42,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {37089#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37089#(< main_~i~0 993)} is VALID [2022-04-28 02:57:42,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {37096#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37089#(< main_~i~0 993)} is VALID [2022-04-28 02:57:42,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {37096#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37096#(< main_~i~0 992)} is VALID [2022-04-28 02:57:42,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {37103#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37096#(< main_~i~0 992)} is VALID [2022-04-28 02:57:42,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {37103#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37103#(< main_~i~0 991)} is VALID [2022-04-28 02:57:42,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {37103#(< main_~i~0 991)} is VALID [2022-04-28 02:57:42,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-28 02:57:42,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-28 02:57:42,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-28 02:57:42,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#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(12, 2); {36519#true} is VALID [2022-04-28 02:57:42,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-28 02:57:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102863878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:42,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-28 02:57:42,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653904043] [2022-04-28 02:57:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653904043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:42,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 02:57:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443694394] [2022-04-28 02:57:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 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 89 [2022-04-28 02:57:42,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:42,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 02:57:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 02:57:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 02:57:42,959 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:47,069 INFO L93 Difference]: Finished difference Result 271 states and 343 transitions. [2022-04-28 02:57:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 02:57:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 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 89 [2022-04-28 02:57:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-28 02:57:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-28 02:57:47,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 334 transitions. [2022-04-28 02:57:47,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:47,308 INFO L225 Difference]: With dead ends: 271 [2022-04-28 02:57:47,308 INFO L226 Difference]: Without dead ends: 254 [2022-04-28 02:57:47,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 02:57:47,309 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 833 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:47,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 32 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-28 02:57:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 92. [2022-04-28 02:57:47,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:47,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,603 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,603 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:47,606 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-28 02:57:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-28 02:57:47,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:47,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:47,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 254 states. [2022-04-28 02:57:47,606 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 254 states. [2022-04-28 02:57:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:47,609 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-28 02:57:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-28 02:57:47,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:47,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:47,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:47,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-28 02:57:47,610 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 89 [2022-04-28 02:57:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-28 02:57:47,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:47,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-28 02:57:47,757 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-28 02:57:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-28 02:57:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 02:57:47,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:47,757 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:47,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:47,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 02:57:47,963 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 69 times [2022-04-28 02:57:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:47,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803014930] [2022-04-28 02:57:47,967 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:47,967 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:47,967 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 70 times [2022-04-28 02:57:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826888583] [2022-04-28 02:57:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:48,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {38469#(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(12, 2); {38429#true} is VALID [2022-04-28 02:57:48,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-28 02:57:48,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-28 02:57:48,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:48,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {38469#(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(12, 2); {38429#true} is VALID [2022-04-28 02:57:48,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-28 02:57:48,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-28 02:57:48,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-28 02:57:48,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38434#(= main_~i~0 0)} is VALID [2022-04-28 02:57:48,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {38434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38434#(= main_~i~0 0)} is VALID [2022-04-28 02:57:48,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {38434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:48,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:48,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:48,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:48,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:48,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:48,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:48,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:48,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:48,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:48,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:48,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:48,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:48,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:48,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:48,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:48,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:48,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:48,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:48,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:48,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:48,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:48,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:48,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:48,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:48,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:48,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:48,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:48,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:48,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:48,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:48,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:48,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:48,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:48,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:48,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:48,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:48,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:48,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:48,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:48,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:48,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:48,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:48,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:48,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:48,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:48,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:48,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:48,410 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:48,410 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:48,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:48,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:48,411 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:48,411 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:48,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:48,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:48,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:48,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:48,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:48,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:48,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:48,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:48,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:48,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-28 02:57:48,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-28 02:57:48,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-28 02:57:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:48,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:48,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826888583] [2022-04-28 02:57:48,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826888583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:48,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002249147] [2022-04-28 02:57:48,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:57:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:48,417 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:48,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 02:57:48,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:57:48,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:48,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 02:57:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:48,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:49,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-28 02:57:49,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#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(12, 2); {38429#true} is VALID [2022-04-28 02:57:49,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-28 02:57:49,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-28 02:57:49,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-28 02:57:49,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38488#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:49,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {38488#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38488#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:49,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {38488#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:49,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:49,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:49,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:49,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:49,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:49,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:49,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:49,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:49,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:49,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:49,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:49,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:49,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:49,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:49,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:49,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:49,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:49,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:49,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:49,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:49,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:49,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:49,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:49,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:49,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:49,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:49,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:49,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:49,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:49,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:49,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:49,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:49,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:49,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:49,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:49,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:49,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:49,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:49,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:49,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:49,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:49,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:49,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:49,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:49,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:49,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:49,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:49,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:49,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:49,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:49,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:49,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:49,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:49,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:49,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:49,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:49,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:49,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:49,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:49,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:49,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:49,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:49,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:49,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:49,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-28 02:57:49,165 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-28 02:57:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:49,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:50,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-28 02:57:50,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-28 02:57:50,753 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-28 02:57:50,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {38792#(< main_~i~0 1024)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-28 02:57:50,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {38796#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38792#(< main_~i~0 1024)} is VALID [2022-04-28 02:57:50,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {38796#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38796#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:50,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {38803#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38796#(< main_~i~0 1023)} is VALID [2022-04-28 02:57:50,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {38803#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38803#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:50,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {38810#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38803#(< main_~i~0 1022)} is VALID [2022-04-28 02:57:50,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {38810#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38810#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:50,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {38817#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38810#(< main_~i~0 1021)} is VALID [2022-04-28 02:57:50,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {38817#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38817#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:50,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {38824#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38817#(< main_~i~0 1020)} is VALID [2022-04-28 02:57:50,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {38824#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38824#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:50,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {38831#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38824#(< main_~i~0 1019)} is VALID [2022-04-28 02:57:50,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {38831#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38831#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:50,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {38838#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38831#(< main_~i~0 1018)} is VALID [2022-04-28 02:57:50,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {38838#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38838#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:50,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {38845#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38838#(< main_~i~0 1017)} is VALID [2022-04-28 02:57:50,759 INFO L290 TraceCheckUtils]: 58: Hoare triple {38845#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38845#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:50,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {38852#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38845#(< main_~i~0 1016)} is VALID [2022-04-28 02:57:50,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {38852#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38852#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:50,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {38859#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38852#(< main_~i~0 1015)} is VALID [2022-04-28 02:57:50,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {38859#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38859#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:50,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {38866#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38859#(< main_~i~0 1014)} is VALID [2022-04-28 02:57:50,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {38866#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38866#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:50,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {38873#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38866#(< main_~i~0 1013)} is VALID [2022-04-28 02:57:50,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {38873#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38873#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:50,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {38880#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38873#(< main_~i~0 1012)} is VALID [2022-04-28 02:57:50,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {38880#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38880#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:50,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {38887#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38880#(< main_~i~0 1011)} is VALID [2022-04-28 02:57:50,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {38887#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38887#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:50,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {38894#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38887#(< main_~i~0 1010)} is VALID [2022-04-28 02:57:50,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {38894#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38894#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:50,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {38901#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38894#(< main_~i~0 1009)} is VALID [2022-04-28 02:57:50,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {38901#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38901#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:50,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {38908#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38901#(< main_~i~0 1008)} is VALID [2022-04-28 02:57:50,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {38908#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38908#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:50,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {38915#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38908#(< main_~i~0 1007)} is VALID [2022-04-28 02:57:50,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {38915#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38915#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:50,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {38922#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38915#(< main_~i~0 1006)} is VALID [2022-04-28 02:57:50,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {38922#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38922#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:50,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {38929#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38922#(< main_~i~0 1005)} is VALID [2022-04-28 02:57:50,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {38929#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38929#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:50,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {38936#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38929#(< main_~i~0 1004)} is VALID [2022-04-28 02:57:50,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {38936#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38936#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:50,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {38943#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38936#(< main_~i~0 1003)} is VALID [2022-04-28 02:57:50,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {38943#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38943#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:50,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {38950#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38943#(< main_~i~0 1002)} is VALID [2022-04-28 02:57:50,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {38950#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38950#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:50,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {38957#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38950#(< main_~i~0 1001)} is VALID [2022-04-28 02:57:50,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {38957#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38957#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:50,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {38964#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38957#(< main_~i~0 1000)} is VALID [2022-04-28 02:57:50,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {38964#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38964#(< main_~i~0 999)} is VALID [2022-04-28 02:57:50,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {38971#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38964#(< main_~i~0 999)} is VALID [2022-04-28 02:57:50,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {38971#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38971#(< main_~i~0 998)} is VALID [2022-04-28 02:57:50,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {38978#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38971#(< main_~i~0 998)} is VALID [2022-04-28 02:57:50,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {38978#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38978#(< main_~i~0 997)} is VALID [2022-04-28 02:57:50,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {38985#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38978#(< main_~i~0 997)} is VALID [2022-04-28 02:57:50,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {38985#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38985#(< main_~i~0 996)} is VALID [2022-04-28 02:57:50,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {38992#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38985#(< main_~i~0 996)} is VALID [2022-04-28 02:57:50,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {38992#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38992#(< main_~i~0 995)} is VALID [2022-04-28 02:57:50,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {38999#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38992#(< main_~i~0 995)} is VALID [2022-04-28 02:57:50,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {38999#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38999#(< main_~i~0 994)} is VALID [2022-04-28 02:57:50,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {39006#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38999#(< main_~i~0 994)} is VALID [2022-04-28 02:57:50,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {39006#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39006#(< main_~i~0 993)} is VALID [2022-04-28 02:57:50,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {39013#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39006#(< main_~i~0 993)} is VALID [2022-04-28 02:57:50,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {39013#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39013#(< main_~i~0 992)} is VALID [2022-04-28 02:57:50,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {39020#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39013#(< main_~i~0 992)} is VALID [2022-04-28 02:57:50,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {39020#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39020#(< main_~i~0 991)} is VALID [2022-04-28 02:57:50,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {39027#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39020#(< main_~i~0 991)} is VALID [2022-04-28 02:57:50,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {39027#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39027#(< main_~i~0 990)} is VALID [2022-04-28 02:57:50,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {39027#(< main_~i~0 990)} is VALID [2022-04-28 02:57:50,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-28 02:57:50,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-28 02:57:50,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-28 02:57:50,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#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(12, 2); {38429#true} is VALID [2022-04-28 02:57:50,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-28 02:57:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:50,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002249147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:50,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:50,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 02:57:50,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:50,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803014930] [2022-04-28 02:57:50,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803014930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:50,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:50,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 02:57:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304935226] [2022-04-28 02:57:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:50,778 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 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 91 [2022-04-28 02:57:50,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:50,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:50,816 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-28 02:57:50,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 02:57:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:50,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 02:57:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 02:57:50,818 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:54,741 INFO L93 Difference]: Finished difference Result 278 states and 352 transitions. [2022-04-28 02:57:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 02:57:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 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 91 [2022-04-28 02:57:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-28 02:57:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-28 02:57:54,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 343 transitions. [2022-04-28 02:57:54,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:54,986 INFO L225 Difference]: With dead ends: 278 [2022-04-28 02:57:54,986 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 02:57:54,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 02:57:54,987 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 810 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:54,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 32 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 02:57:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 94. [2022-04-28 02:57:55,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:55,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:55,407 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:55,407 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:55,410 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-28 02:57:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-28 02:57:55,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:55,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:55,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 02:57:55,411 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 02:57:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:55,413 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-28 02:57:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-28 02:57:55,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:55,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:55,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:55,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-28 02:57:55,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 91 [2022-04-28 02:57:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:55,415 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-28 02:57:55,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:55,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 98 transitions. [2022-04-28 02:57:55,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-28 02:57:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 02:57:55,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:55,565 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:55,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 02:57:55,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:55,782 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 71 times [2022-04-28 02:57:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:55,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048879137] [2022-04-28 02:57:55,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:57:55,786 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:57:55,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:57:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 72 times [2022-04-28 02:57:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:55,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253657378] [2022-04-28 02:57:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:56,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {40428#(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(12, 2); {40387#true} is VALID [2022-04-28 02:57:56,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:56,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {40428#(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(12, 2); {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-28 02:57:56,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40392#(= main_~i~0 0)} is VALID [2022-04-28 02:57:56,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {40392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40392#(= main_~i~0 0)} is VALID [2022-04-28 02:57:56,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {40392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {40393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {40393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {40394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {40394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40395#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:56,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {40395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40395#(<= main_~i~0 3)} is VALID [2022-04-28 02:57:56,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {40395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40396#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:56,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {40396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40396#(<= main_~i~0 4)} is VALID [2022-04-28 02:57:56,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {40396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40397#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:56,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {40397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40397#(<= main_~i~0 5)} is VALID [2022-04-28 02:57:56,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {40397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40398#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:56,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {40398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40398#(<= main_~i~0 6)} is VALID [2022-04-28 02:57:56,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {40398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40399#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:56,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {40399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40399#(<= main_~i~0 7)} is VALID [2022-04-28 02:57:56,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40400#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:56,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {40400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40400#(<= main_~i~0 8)} is VALID [2022-04-28 02:57:56,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {40400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40401#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:56,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {40401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40401#(<= main_~i~0 9)} is VALID [2022-04-28 02:57:56,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {40401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40402#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:56,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {40402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40402#(<= main_~i~0 10)} is VALID [2022-04-28 02:57:56,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {40402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40403#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:56,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {40403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40403#(<= main_~i~0 11)} is VALID [2022-04-28 02:57:56,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {40403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40404#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:56,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {40404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40404#(<= main_~i~0 12)} is VALID [2022-04-28 02:57:56,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {40404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40405#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:56,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {40405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40405#(<= main_~i~0 13)} is VALID [2022-04-28 02:57:56,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {40405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40406#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:56,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {40406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40406#(<= main_~i~0 14)} is VALID [2022-04-28 02:57:56,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {40406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40407#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:56,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {40407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40407#(<= main_~i~0 15)} is VALID [2022-04-28 02:57:56,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {40407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40408#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:56,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {40408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40408#(<= main_~i~0 16)} is VALID [2022-04-28 02:57:56,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {40408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40409#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:56,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {40409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40409#(<= main_~i~0 17)} is VALID [2022-04-28 02:57:56,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {40409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40410#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:56,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {40410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40410#(<= main_~i~0 18)} is VALID [2022-04-28 02:57:56,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {40410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40411#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:56,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {40411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40411#(<= main_~i~0 19)} is VALID [2022-04-28 02:57:56,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {40411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40412#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:56,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {40412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40412#(<= main_~i~0 20)} is VALID [2022-04-28 02:57:56,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {40412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40413#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:56,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {40413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40413#(<= main_~i~0 21)} is VALID [2022-04-28 02:57:56,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {40413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40414#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:56,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {40414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40414#(<= main_~i~0 22)} is VALID [2022-04-28 02:57:56,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {40414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40415#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:56,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {40415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40415#(<= main_~i~0 23)} is VALID [2022-04-28 02:57:56,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {40415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40416#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:56,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {40416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40416#(<= main_~i~0 24)} is VALID [2022-04-28 02:57:56,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {40416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40417#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:56,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {40417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40417#(<= main_~i~0 25)} is VALID [2022-04-28 02:57:56,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {40417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40418#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:56,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {40418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40418#(<= main_~i~0 26)} is VALID [2022-04-28 02:57:56,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {40418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40419#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:56,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {40419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40419#(<= main_~i~0 27)} is VALID [2022-04-28 02:57:56,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {40419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40420#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:56,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {40420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40420#(<= main_~i~0 28)} is VALID [2022-04-28 02:57:56,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {40420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40421#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:56,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {40421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40421#(<= main_~i~0 29)} is VALID [2022-04-28 02:57:56,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {40421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40422#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:56,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {40422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40422#(<= main_~i~0 30)} is VALID [2022-04-28 02:57:56,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {40422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40423#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:56,356 INFO L290 TraceCheckUtils]: 68: Hoare triple {40423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40423#(<= main_~i~0 31)} is VALID [2022-04-28 02:57:56,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {40423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40424#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:56,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {40424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40424#(<= main_~i~0 32)} is VALID [2022-04-28 02:57:56,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {40424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40425#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:56,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {40425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40425#(<= main_~i~0 33)} is VALID [2022-04-28 02:57:56,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {40425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40426#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:56,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {40426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40426#(<= main_~i~0 34)} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {40426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40427#(<= main_~i~0 35)} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {40427#(<= main_~i~0 35)} assume !(~i~0 < 1024); {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {40388#false} ~i~0 := 0; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 78: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 79: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-28 02:57:56,359 INFO L290 TraceCheckUtils]: 83: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {40388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L272 TraceCheckUtils]: 89: Hoare triple {40388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {40388#false} ~cond := #in~cond; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {40388#false} assume 0 == ~cond; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-28 02:57:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:57:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253657378] [2022-04-28 02:57:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253657378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323593394] [2022-04-28 02:57:56,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:57:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:56,362 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:57:56,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 02:57:56,531 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:57:56,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:57:56,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:57:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:57:56,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-28 02:57:56,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#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(12, 2); {40387#true} is VALID [2022-04-28 02:57:56,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:56,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-28 02:57:56,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40663#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:56,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {40663#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {40663#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:56,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {40663#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40663#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:56,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {40663#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40663#(<= main_~i~0 0)} is VALID [2022-04-28 02:57:56,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {40663#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,800 INFO L290 TraceCheckUtils]: 82: Hoare triple {40393#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,801 INFO L290 TraceCheckUtils]: 83: Hoare triple {40393#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {40393#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40393#(<= main_~i~0 1)} is VALID [2022-04-28 02:57:56,801 INFO L290 TraceCheckUtils]: 85: Hoare triple {40393#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,801 INFO L290 TraceCheckUtils]: 86: Hoare triple {40394#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {40394#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {40394#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40394#(<= main_~i~0 2)} is VALID [2022-04-28 02:57:56,803 INFO L272 TraceCheckUtils]: 89: Hoare triple {40394#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:56,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:56,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-28 02:57:56,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-28 02:57:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-28 02:57:56,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:57:57,069 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-28 02:57:57,070 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-28 02:57:57,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:57,070 INFO L272 TraceCheckUtils]: 89: Hoare triple {40720#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:57,071 INFO L290 TraceCheckUtils]: 88: Hoare triple {40720#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40720#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:57,071 INFO L290 TraceCheckUtils]: 87: Hoare triple {40720#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40720#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:57,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {40720#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {40720#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:57,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {40733#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40720#(<= main_~i~0 512)} is VALID [2022-04-28 02:57:57,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {40733#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40733#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:57,072 INFO L290 TraceCheckUtils]: 83: Hoare triple {40733#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40733#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:57,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {40733#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {40733#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:57,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {40746#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40733#(<= main_~i~0 511)} is VALID [2022-04-28 02:57:57,073 INFO L290 TraceCheckUtils]: 80: Hoare triple {40746#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40746#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:57,073 INFO L290 TraceCheckUtils]: 79: Hoare triple {40746#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40746#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {40746#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {40746#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40746#(<= main_~i~0 510)} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#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(12, 2); {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-28 02:57:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-28 02:57:57,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323593394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:57:57,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:57:57,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 7, 7] total 45 [2022-04-28 02:57:57,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:57,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048879137] [2022-04-28 02:57:57,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048879137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:57,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:57,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 02:57:57,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275670438] [2022-04-28 02:57:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 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 93 [2022-04-28 02:57:57,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:57,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:57,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 02:57:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 02:57:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=1113, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 02:57:57,136 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:01,602 INFO L93 Difference]: Finished difference Result 285 states and 361 transitions. [2022-04-28 02:58:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 02:58:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 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 93 [2022-04-28 02:58:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-28 02:58:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-28 02:58:01,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 352 transitions. [2022-04-28 02:58:01,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:01,859 INFO L225 Difference]: With dead ends: 285 [2022-04-28 02:58:01,859 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 02:58:01,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2380, Invalid=4100, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 02:58:01,860 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 819 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:01,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 42 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:58:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 02:58:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 96. [2022-04-28 02:58:02,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:02,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,291 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,291 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:02,294 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-28 02:58:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-28 02:58:02,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:02,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:02,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-28 02:58:02,295 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-28 02:58:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:02,297 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-28 02:58:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-28 02:58:02,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:02,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:02,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:02,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-28 02:58:02,299 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 93 [2022-04-28 02:58:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:02,299 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-28 02:58:02,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:02,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-28 02:58:02,464 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-28 02:58:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 02:58:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 02:58:02,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:02,464 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:02,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:02,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 02:58:02,671 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 73 times [2022-04-28 02:58:02,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:02,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930970879] [2022-04-28 02:58:02,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:02,675 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:02,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 74 times [2022-04-28 02:58:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:02,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661258160] [2022-04-28 02:58:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {42404#(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(12, 2); {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:03,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {42404#(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(12, 2); {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-28 02:58:03,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-28 02:58:03,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42367#(= main_~i~0 0)} is VALID [2022-04-28 02:58:03,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {42367#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42367#(= main_~i~0 0)} is VALID [2022-04-28 02:58:03,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {42367#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:03,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:03,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:03,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:03,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:03,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:03,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:03,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:03,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:03,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:03,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:03,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:03,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:03,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:03,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:03,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:03,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:03,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:03,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:03,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:03,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:03,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:03,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:03,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:03,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:03,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:03,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:03,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:03,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:03,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:03,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:03,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:03,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:03,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:03,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:03,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:03,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:03,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:03,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:03,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:03,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:03,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:03,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:03,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:03,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:03,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:03,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:03,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:03,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:03,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:03,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:03,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:03,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:03,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:03,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:03,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:03,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:03,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:03,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:03,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:03,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:03,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:03,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:03,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:03,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:03,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:03,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:03,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:03,291 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:03,291 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,292 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-28 02:58:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661258160] [2022-04-28 02:58:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661258160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514647222] [2022-04-28 02:58:03,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:03,295 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:03,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 02:58:03,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:03,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:03,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 02:58:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:03,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:03,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-28 02:58:03,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#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(12, 2); {42362#true} is VALID [2022-04-28 02:58:03,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-28 02:58:03,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-28 02:58:03,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-28 02:58:03,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42423#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:03,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {42423#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42423#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:03,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {42423#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:03,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:03,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:03,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:03,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:03,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:03,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:03,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:03,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:03,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:03,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:03,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:03,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:03,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:03,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:03,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:03,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:03,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:03,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:03,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:03,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:03,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:03,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:03,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:03,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:03,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:03,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:03,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:03,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:03,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:03,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:03,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:03,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:03,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:03,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:03,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:03,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:03,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:03,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:03,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:03,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:03,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:03,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:03,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:03,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:03,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:03,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:03,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:03,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:03,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:03,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:03,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:03,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:03,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:03,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:03,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:03,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:03,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:03,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:03,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:03,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:03,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:03,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:03,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:03,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:03,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:03,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:03,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-28 02:58:03,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-28 02:58:03,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-28 02:58:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:03,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:05,327 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-28 02:58:05,328 INFO L290 TraceCheckUtils]: 78: Hoare triple {42739#(< main_~i~0 1024)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-28 02:58:05,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {42743#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42739#(< main_~i~0 1024)} is VALID [2022-04-28 02:58:05,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {42743#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42743#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:05,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {42750#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42743#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:05,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {42750#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42750#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:05,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {42757#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42750#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:05,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {42757#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42757#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:05,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {42764#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42757#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:05,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {42764#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42764#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:05,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {42771#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42764#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:05,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {42771#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42771#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:05,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {42778#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42771#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:05,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {42778#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42778#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:05,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {42785#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42778#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:05,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {42785#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42785#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:05,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {42792#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42785#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:05,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {42792#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42792#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:05,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {42799#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42792#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:05,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {42799#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42799#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:05,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {42806#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42799#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:05,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {42806#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42806#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:05,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {42813#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42806#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:05,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {42813#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42813#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:05,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {42820#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42813#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:05,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {42820#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42820#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:05,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {42827#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42820#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:05,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {42827#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42827#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:05,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {42834#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42827#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:05,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {42834#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42834#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:05,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {42841#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42834#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:05,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {42841#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42841#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:05,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {42848#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42841#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:05,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {42848#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42848#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:05,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {42855#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42848#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:05,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {42855#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42855#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:05,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {42862#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42855#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:05,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {42862#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42862#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:05,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {42869#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42862#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:05,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {42869#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42869#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:05,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {42876#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42869#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:05,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {42876#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42876#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:05,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {42883#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42876#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:05,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {42883#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42883#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:05,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {42890#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42883#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:05,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {42890#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42890#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:05,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {42897#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42890#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:05,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {42897#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42897#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:05,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {42904#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42897#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:05,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {42904#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42904#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:05,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {42911#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42904#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:05,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {42911#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42911#(< main_~i~0 999)} is VALID [2022-04-28 02:58:05,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {42918#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42911#(< main_~i~0 999)} is VALID [2022-04-28 02:58:05,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {42918#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42918#(< main_~i~0 998)} is VALID [2022-04-28 02:58:05,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {42925#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42918#(< main_~i~0 998)} is VALID [2022-04-28 02:58:05,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {42925#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42925#(< main_~i~0 997)} is VALID [2022-04-28 02:58:05,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {42932#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42925#(< main_~i~0 997)} is VALID [2022-04-28 02:58:05,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {42932#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42932#(< main_~i~0 996)} is VALID [2022-04-28 02:58:05,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {42939#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42932#(< main_~i~0 996)} is VALID [2022-04-28 02:58:05,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {42939#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42939#(< main_~i~0 995)} is VALID [2022-04-28 02:58:05,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {42946#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42939#(< main_~i~0 995)} is VALID [2022-04-28 02:58:05,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {42946#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42946#(< main_~i~0 994)} is VALID [2022-04-28 02:58:05,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {42953#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42946#(< main_~i~0 994)} is VALID [2022-04-28 02:58:05,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {42953#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42953#(< main_~i~0 993)} is VALID [2022-04-28 02:58:05,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {42960#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42953#(< main_~i~0 993)} is VALID [2022-04-28 02:58:05,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {42960#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42960#(< main_~i~0 992)} is VALID [2022-04-28 02:58:05,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {42967#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42960#(< main_~i~0 992)} is VALID [2022-04-28 02:58:05,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {42967#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42967#(< main_~i~0 991)} is VALID [2022-04-28 02:58:05,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {42974#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42967#(< main_~i~0 991)} is VALID [2022-04-28 02:58:05,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {42974#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42974#(< main_~i~0 990)} is VALID [2022-04-28 02:58:05,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {42981#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42974#(< main_~i~0 990)} is VALID [2022-04-28 02:58:05,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {42981#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42981#(< main_~i~0 989)} is VALID [2022-04-28 02:58:05,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {42988#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42981#(< main_~i~0 989)} is VALID [2022-04-28 02:58:05,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {42988#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42988#(< main_~i~0 988)} is VALID [2022-04-28 02:58:05,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42988#(< main_~i~0 988)} is VALID [2022-04-28 02:58:05,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-28 02:58:05,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-28 02:58:05,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-28 02:58:05,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#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(12, 2); {42362#true} is VALID [2022-04-28 02:58:05,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-28 02:58:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:05,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514647222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:05,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:05,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-28 02:58:05,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:05,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930970879] [2022-04-28 02:58:05,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930970879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:05,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:05,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 02:58:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628943409] [2022-04-28 02:58:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 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 95 [2022-04-28 02:58:05,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:05,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:05,410 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-28 02:58:05,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 02:58:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:05,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 02:58:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 02:58:05,411 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:09,173 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2022-04-28 02:58:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 02:58:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 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 95 [2022-04-28 02:58:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-28 02:58:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-28 02:58:09,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 361 transitions. [2022-04-28 02:58:09,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:09,335 INFO L225 Difference]: With dead ends: 292 [2022-04-28 02:58:09,336 INFO L226 Difference]: Without dead ends: 275 [2022-04-28 02:58:09,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 02:58:09,339 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 880 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:09,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 37 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:58:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-28 02:58:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 98. [2022-04-28 02:58:09,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:09,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,636 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,636 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:09,638 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-28 02:58:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-28 02:58:09,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:09,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:09,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-28 02:58:09,639 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-28 02:58:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:09,642 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-28 02:58:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-28 02:58:09,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:09,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:09,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:09,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-28 02:58:09,643 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 95 [2022-04-28 02:58:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:09,643 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-28 02:58:09,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:09,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-28 02:58:09,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-28 02:58:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 02:58:09,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:09,789 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:09,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 02:58:10,003 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 75 times [2022-04-28 02:58:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202003719] [2022-04-28 02:58:10,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:10,007 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:10,007 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 76 times [2022-04-28 02:58:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302658077] [2022-04-28 02:58:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {44459#(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(12, 2); {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:10,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {44459#(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(12, 2); {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-28 02:58:10,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-28 02:58:10,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44421#(= main_~i~0 0)} is VALID [2022-04-28 02:58:10,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {44421#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44421#(= main_~i~0 0)} is VALID [2022-04-28 02:58:10,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {44421#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:10,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:10,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:10,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:10,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:10,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:10,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:10,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:10,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:10,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:10,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:10,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:10,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:10,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:10,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:10,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:10,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:10,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:10,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:10,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:10,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:10,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:10,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:10,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:10,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:10,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:10,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:10,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:10,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:10,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:10,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:10,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:10,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:10,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:10,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:10,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:10,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:10,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:10,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:10,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:10,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:10,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:10,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:10,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:10,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:10,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:10,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:10,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:10,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:10,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:10,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:10,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:10,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:10,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:10,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:10,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:10,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:10,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:10,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:10,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:10,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:10,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:10,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:10,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:10,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:10,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:10,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:10,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:10,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:10,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:10,439 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:10,440 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-28 02:58:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:10,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302658077] [2022-04-28 02:58:10,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302658077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200515850] [2022-04-28 02:58:10,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:10,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:10,443 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:10,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 02:58:10,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:10,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:10,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 02:58:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:10,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:11,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-28 02:58:11,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#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(12, 2); {44416#true} is VALID [2022-04-28 02:58:11,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-28 02:58:11,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-28 02:58:11,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-28 02:58:11,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44478#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:11,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {44478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44478#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:11,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {44478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:11,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:11,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:11,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:11,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:11,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:11,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:11,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:11,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:11,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:11,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:11,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:11,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:11,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:11,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:11,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:11,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:11,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:11,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:11,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:11,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:11,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:11,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:11,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:11,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:11,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:11,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:11,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:11,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:11,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:11,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:11,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:11,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:11,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:11,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:11,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:11,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:11,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:11,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:11,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:11,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:11,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:11,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:11,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:11,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:11,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:11,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:11,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:11,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:11,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:11,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:11,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:11,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:11,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:11,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:11,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:11,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:11,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:11,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:11,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:11,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:11,252 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:11,252 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:11,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:11,253 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:11,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:11,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:11,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:11,254 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:11,254 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:11,254 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:11,255 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:11,255 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:11,255 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-28 02:58:11,256 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-28 02:58:11,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-28 02:58:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:11,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:12,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-28 02:58:12,647 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-28 02:58:12,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-28 02:58:12,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-28 02:58:12,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {44800#(< main_~i~0 1024)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-28 02:58:12,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {44804#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44800#(< main_~i~0 1024)} is VALID [2022-04-28 02:58:12,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {44804#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44804#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:12,649 INFO L290 TraceCheckUtils]: 77: Hoare triple {44811#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44804#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:12,649 INFO L290 TraceCheckUtils]: 76: Hoare triple {44811#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44811#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:12,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {44818#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44811#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:12,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {44818#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44818#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:12,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {44825#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44818#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:12,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {44825#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44825#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:12,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {44832#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44825#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:12,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {44832#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44832#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:12,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {44839#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44832#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:12,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {44839#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44839#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:12,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {44846#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44839#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:12,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {44846#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44846#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:12,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {44853#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44846#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:12,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {44853#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44853#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:12,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {44860#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44853#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:12,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {44860#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44860#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:12,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {44867#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44860#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:12,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {44867#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44867#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:12,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {44874#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44867#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:12,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {44874#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44874#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:12,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {44881#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44874#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:12,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {44881#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44881#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:12,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {44888#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44881#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:12,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {44888#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44888#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:12,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {44895#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44888#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:12,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {44895#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44895#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:12,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {44902#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44895#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:12,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {44902#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44902#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:12,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {44909#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44902#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:12,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {44909#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44909#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:12,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {44916#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44909#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:12,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {44916#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44916#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:12,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {44923#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44916#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:12,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {44923#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44923#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:12,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {44930#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44923#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:12,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {44930#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44930#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:12,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {44937#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44930#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:12,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {44937#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44937#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:12,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {44944#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44937#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:12,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {44944#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44944#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:12,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {44951#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44944#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:12,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {44951#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44951#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:12,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {44958#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44951#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:12,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {44958#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44958#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:12,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {44965#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44958#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:12,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {44965#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44965#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:12,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44965#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:12,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {44972#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44972#(< main_~i~0 999)} is VALID [2022-04-28 02:58:12,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {44979#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44972#(< main_~i~0 999)} is VALID [2022-04-28 02:58:12,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {44979#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44979#(< main_~i~0 998)} is VALID [2022-04-28 02:58:12,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {44986#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44979#(< main_~i~0 998)} is VALID [2022-04-28 02:58:12,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {44986#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44986#(< main_~i~0 997)} is VALID [2022-04-28 02:58:12,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {44993#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44986#(< main_~i~0 997)} is VALID [2022-04-28 02:58:12,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {44993#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44993#(< main_~i~0 996)} is VALID [2022-04-28 02:58:12,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {45000#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44993#(< main_~i~0 996)} is VALID [2022-04-28 02:58:12,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {45000#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45000#(< main_~i~0 995)} is VALID [2022-04-28 02:58:12,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {45007#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45000#(< main_~i~0 995)} is VALID [2022-04-28 02:58:12,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {45007#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45007#(< main_~i~0 994)} is VALID [2022-04-28 02:58:12,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {45014#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45007#(< main_~i~0 994)} is VALID [2022-04-28 02:58:12,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {45014#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45014#(< main_~i~0 993)} is VALID [2022-04-28 02:58:12,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {45021#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45014#(< main_~i~0 993)} is VALID [2022-04-28 02:58:12,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {45021#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45021#(< main_~i~0 992)} is VALID [2022-04-28 02:58:12,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {45028#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45021#(< main_~i~0 992)} is VALID [2022-04-28 02:58:12,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {45028#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45028#(< main_~i~0 991)} is VALID [2022-04-28 02:58:12,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {45035#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45028#(< main_~i~0 991)} is VALID [2022-04-28 02:58:12,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {45035#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45035#(< main_~i~0 990)} is VALID [2022-04-28 02:58:12,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {45042#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45035#(< main_~i~0 990)} is VALID [2022-04-28 02:58:12,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {45042#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45042#(< main_~i~0 989)} is VALID [2022-04-28 02:58:12,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {45049#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45042#(< main_~i~0 989)} is VALID [2022-04-28 02:58:12,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {45049#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45049#(< main_~i~0 988)} is VALID [2022-04-28 02:58:12,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {45056#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45049#(< main_~i~0 988)} is VALID [2022-04-28 02:58:12,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {45056#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45056#(< main_~i~0 987)} is VALID [2022-04-28 02:58:12,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {45056#(< main_~i~0 987)} is VALID [2022-04-28 02:58:12,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-28 02:58:12,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-28 02:58:12,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-28 02:58:12,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#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(12, 2); {44416#true} is VALID [2022-04-28 02:58:12,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-28 02:58:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:12,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200515850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:12,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-28 02:58:12,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:12,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202003719] [2022-04-28 02:58:12,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202003719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:12,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 02:58:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201063194] [2022-04-28 02:58:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 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 97 [2022-04-28 02:58:12,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:12,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:12,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:12,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 02:58:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:12,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 02:58:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 02:58:12,714 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:16,690 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2022-04-28 02:58:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 02:58:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 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 97 [2022-04-28 02:58:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-28 02:58:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-28 02:58:16,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 370 transitions. [2022-04-28 02:58:16,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:16,860 INFO L225 Difference]: With dead ends: 299 [2022-04-28 02:58:16,860 INFO L226 Difference]: Without dead ends: 282 [2022-04-28 02:58:16,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 02:58:16,861 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 858 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 37 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:58:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-28 02:58:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 100. [2022-04-28 02:58:17,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:17,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,234 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,234 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:17,237 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-28 02:58:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-28 02:58:17,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:17,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:17,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-28 02:58:17,238 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 282 states. [2022-04-28 02:58:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:17,241 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-28 02:58:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-28 02:58:17,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:17,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:17,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:17,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2022-04-28 02:58:17,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 97 [2022-04-28 02:58:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2022-04-28 02:58:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:17,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 104 transitions. [2022-04-28 02:58:17,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2022-04-28 02:58:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 02:58:17,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:17,427 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:17,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:17,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:17,644 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 77 times [2022-04-28 02:58:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7286465] [2022-04-28 02:58:17,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:17,647 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:17,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 78 times [2022-04-28 02:58:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:17,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362537515] [2022-04-28 02:58:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {46562#(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(12, 2); {46518#true} is VALID [2022-04-28 02:58:18,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-28 02:58:18,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-28 02:58:18,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:18,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {46562#(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(12, 2); {46518#true} is VALID [2022-04-28 02:58:18,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-28 02:58:18,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-28 02:58:18,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-28 02:58:18,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46523#(= main_~i~0 0)} is VALID [2022-04-28 02:58:18,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {46523#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46523#(= main_~i~0 0)} is VALID [2022-04-28 02:58:18,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {46523#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {46524#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {46524#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {46525#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {46525#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46526#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:18,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {46526#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46526#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:18,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {46526#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46527#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:18,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {46527#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46527#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:18,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {46527#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46528#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:18,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {46528#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46528#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:18,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {46528#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46529#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:18,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {46529#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46529#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:18,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {46529#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46530#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:18,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {46530#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46530#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:18,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {46530#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46531#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:18,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {46531#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46531#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:18,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {46531#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46532#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:18,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {46532#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46532#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:18,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {46532#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46533#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:18,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {46533#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46533#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:18,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {46533#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46534#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:18,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {46534#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46534#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:18,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {46534#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46535#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:18,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {46535#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46535#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:18,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {46535#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46536#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:18,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {46536#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46536#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:18,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {46536#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46537#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:18,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {46537#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46537#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:18,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {46537#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46538#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:18,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {46538#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46538#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:18,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {46538#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46539#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:18,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {46539#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46539#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:18,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {46539#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46540#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:18,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {46540#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46540#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:18,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {46540#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46541#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:18,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {46541#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46541#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:18,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {46541#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46542#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:18,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {46542#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46542#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:18,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {46542#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46543#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:18,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {46543#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46543#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:18,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {46543#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46544#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:18,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {46544#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46544#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:18,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {46544#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46545#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:18,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {46545#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46545#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:18,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {46545#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46546#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:18,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {46546#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46546#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:18,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {46546#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46547#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:18,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {46547#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46547#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:18,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {46547#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46548#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:18,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {46548#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46548#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:18,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {46548#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46549#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:18,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {46549#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46549#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:18,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {46549#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46550#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:18,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {46550#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46550#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:18,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {46550#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46551#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:18,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {46551#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46551#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:18,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {46551#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46552#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:18,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {46552#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46552#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:18,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {46552#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46553#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:18,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {46553#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46553#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:18,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {46553#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46554#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:18,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {46554#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46554#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:18,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {46554#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46555#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:18,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {46555#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46555#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:18,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {46555#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46556#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:18,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {46556#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46556#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:18,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {46556#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46557#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:18,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {46557#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46557#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:18,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {46557#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46558#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:18,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {46558#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46558#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:18,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {46558#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46559#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:18,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {46559#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46559#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:18,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {46559#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46560#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:18,234 INFO L290 TraceCheckUtils]: 80: Hoare triple {46560#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46560#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {46560#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46561#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 82: Hoare triple {46561#(<= main_~i~0 38)} assume !(~i~0 < 1024); {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 83: Hoare triple {46519#false} ~i~0 := 0; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-28 02:58:18,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 91: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 92: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {46519#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L272 TraceCheckUtils]: 95: Hoare triple {46519#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {46519#false} ~cond := #in~cond; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {46519#false} assume 0 == ~cond; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-28 02:58:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:18,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362537515] [2022-04-28 02:58:18,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362537515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:18,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425552954] [2022-04-28 02:58:18,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:18,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:18,238 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:18,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 02:58:18,423 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:58:18,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:18,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:58:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:18,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:18,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-28 02:58:18,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#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(12, 2); {46518#true} is VALID [2022-04-28 02:58:18,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-28 02:58:18,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-28 02:58:18,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46815#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:18,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {46815#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {46815#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:18,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {46815#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46815#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:18,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {46815#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46815#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:18,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {46815#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {46524#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,601 INFO L290 TraceCheckUtils]: 89: Hoare triple {46524#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,602 INFO L290 TraceCheckUtils]: 90: Hoare triple {46524#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46524#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:18,602 INFO L290 TraceCheckUtils]: 91: Hoare triple {46524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,602 INFO L290 TraceCheckUtils]: 92: Hoare triple {46525#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,603 INFO L290 TraceCheckUtils]: 93: Hoare triple {46525#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,603 INFO L290 TraceCheckUtils]: 94: Hoare triple {46525#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46525#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:18,603 INFO L272 TraceCheckUtils]: 95: Hoare triple {46525#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:18,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:18,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-28 02:58:18,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-28 02:58:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-28 02:58:18,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:18,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-28 02:58:18,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-28 02:58:18,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:18,829 INFO L272 TraceCheckUtils]: 95: Hoare triple {46872#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:18,830 INFO L290 TraceCheckUtils]: 94: Hoare triple {46872#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46872#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:18,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {46872#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46872#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:18,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {46872#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {46872#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:18,830 INFO L290 TraceCheckUtils]: 91: Hoare triple {46885#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46872#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:18,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {46885#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46885#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:18,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {46885#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46885#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:18,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {46885#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {46885#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:18,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {46898#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46885#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:18,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {46898#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46898#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:18,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {46898#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46898#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 84: Hoare triple {46898#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {46898#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46898#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#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(12, 2); {46518#true} is VALID [2022-04-28 02:58:18,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-28 02:58:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-28 02:58:18,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425552954] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:18,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:18,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 7, 7] total 48 [2022-04-28 02:58:18,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:18,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7286465] [2022-04-28 02:58:18,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7286465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:18,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:18,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 02:58:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155267579] [2022-04-28 02:58:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 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 99 [2022-04-28 02:58:18,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:18,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:18,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:18,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 02:58:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 02:58:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=1260, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:58:18,877 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:23,853 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2022-04-28 02:58:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 02:58:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 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 99 [2022-04-28 02:58:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-28 02:58:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-28 02:58:23,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 379 transitions. [2022-04-28 02:58:24,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:24,127 INFO L225 Difference]: With dead ends: 306 [2022-04-28 02:58:24,127 INFO L226 Difference]: Without dead ends: 289 [2022-04-28 02:58:24,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2752, Invalid=4730, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 02:58:24,129 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 770 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:24,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 52 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:58:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-28 02:58:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 102. [2022-04-28 02:58:24,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:24,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,635 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,635 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:24,638 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-28 02:58:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-28 02:58:24,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:24,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:24,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 02:58:24,638 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 02:58:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:24,641 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-28 02:58:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-28 02:58:24,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:24,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:24,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:24,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-04-28 02:58:24,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 99 [2022-04-28 02:58:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:24,643 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-04-28 02:58:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:24,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 106 transitions. [2022-04-28 02:58:24,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-28 02:58:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 02:58:24,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:24,834 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:24,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 02:58:25,048 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 79 times [2022-04-28 02:58:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911960864] [2022-04-28 02:58:25,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:25,052 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:25,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 80 times [2022-04-28 02:58:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:25,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204420687] [2022-04-28 02:58:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {48679#(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(12, 2); {48634#true} is VALID [2022-04-28 02:58:25,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-28 02:58:25,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-28 02:58:25,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:25,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {48679#(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(12, 2); {48634#true} is VALID [2022-04-28 02:58:25,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-28 02:58:25,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-28 02:58:25,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-28 02:58:25,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48639#(= main_~i~0 0)} is VALID [2022-04-28 02:58:25,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {48639#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48639#(= main_~i~0 0)} is VALID [2022-04-28 02:58:25,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {48639#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:25,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:25,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:25,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:25,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:25,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:25,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:25,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:25,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:25,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:25,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:25,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:25,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:25,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:25,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:25,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:25,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:25,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:25,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:25,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:25,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:25,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:25,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:25,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:25,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:25,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:25,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:25,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:25,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:25,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:25,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:25,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:25,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:25,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:25,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:25,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:25,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:25,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:25,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:25,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:25,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:25,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:25,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:25,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:25,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:25,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:25,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:25,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:25,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:25,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:25,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:25,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:25,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:25,724 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:25,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:25,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:25,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:25,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:25,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:25,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:25,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:25,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:25,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:25,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:25,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:25,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:25,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:25,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:25,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:25,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:25,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:25,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:25,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:25,731 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:25,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:25,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:25,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-28 02:58:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:25,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204420687] [2022-04-28 02:58:25,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204420687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:25,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945268602] [2022-04-28 02:58:25,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:25,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:25,735 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:25,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 02:58:25,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:25,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:25,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 02:58:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:25,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:26,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-28 02:58:26,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#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(12, 2); {48634#true} is VALID [2022-04-28 02:58:26,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-28 02:58:26,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-28 02:58:26,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-28 02:58:26,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48698#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:26,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {48698#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48698#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:26,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {48698#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:26,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:26,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:26,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:26,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:26,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:26,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:26,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:26,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:26,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:26,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:26,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:26,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:26,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:26,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:26,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:26,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:26,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:26,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:26,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:26,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:26,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:26,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:26,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:26,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:26,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:26,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:26,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:26,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:26,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:26,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:26,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:26,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:26,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:26,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:26,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:26,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:26,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:26,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:26,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:26,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:26,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:26,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:26,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:26,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:26,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:26,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:26,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:26,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:26,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:26,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:26,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:26,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:26,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:26,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:26,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:26,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:26,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:26,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:26,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:26,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:26,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:26,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:26,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:26,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:26,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:26,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:26,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:26,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:26,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:26,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:26,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:26,606 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:26,606 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:26,606 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:26,607 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:26,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:26,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-28 02:58:26,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-28 02:58:26,608 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-28 02:58:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:26,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:28,295 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-28 02:58:28,296 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {49032#(< main_~i~0 1024)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-28 02:58:28,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {49036#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49032#(< main_~i~0 1024)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {49036#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49036#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {49043#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49036#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:28,298 INFO L290 TraceCheckUtils]: 80: Hoare triple {49043#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49043#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 79: Hoare triple {49050#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49043#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 78: Hoare triple {49050#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49050#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:28,299 INFO L290 TraceCheckUtils]: 77: Hoare triple {49057#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49050#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {49057#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49057#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {49064#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49057#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:28,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {49064#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49064#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:28,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {49071#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49064#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:28,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {49071#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49071#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:28,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {49078#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49071#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:28,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {49078#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49078#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:28,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {49085#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49078#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:28,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {49085#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49085#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:28,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {49092#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49085#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:28,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {49092#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49092#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:28,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {49099#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49092#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:28,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {49099#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49099#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:28,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {49106#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49099#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:28,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {49106#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49106#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:28,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {49113#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49106#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:28,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {49113#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49113#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:28,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {49120#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49113#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:28,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {49120#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49120#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:28,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {49127#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49120#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:28,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {49127#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49127#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:28,307 INFO L290 TraceCheckUtils]: 55: Hoare triple {49134#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49127#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:28,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {49134#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49134#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:28,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {49141#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49134#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:28,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {49141#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49141#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:28,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {49148#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49141#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:28,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {49148#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49148#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:28,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {49155#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49148#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:28,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {49155#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49155#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:28,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {49162#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49155#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:28,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {49162#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49162#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:28,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {49169#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49162#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:28,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {49169#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49169#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:28,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {49176#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49169#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:28,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {49176#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49176#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:28,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {49183#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49176#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:28,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {49183#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49183#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:28,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {49190#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49183#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:28,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {49190#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49190#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:28,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {49197#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49190#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:28,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {49197#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49197#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:28,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {49204#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49197#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:28,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {49204#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49204#(< main_~i~0 999)} is VALID [2022-04-28 02:58:28,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {49211#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49204#(< main_~i~0 999)} is VALID [2022-04-28 02:58:28,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {49211#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49211#(< main_~i~0 998)} is VALID [2022-04-28 02:58:28,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {49218#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49211#(< main_~i~0 998)} is VALID [2022-04-28 02:58:28,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {49218#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49218#(< main_~i~0 997)} is VALID [2022-04-28 02:58:28,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {49225#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49218#(< main_~i~0 997)} is VALID [2022-04-28 02:58:28,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {49225#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49225#(< main_~i~0 996)} is VALID [2022-04-28 02:58:28,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {49232#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49225#(< main_~i~0 996)} is VALID [2022-04-28 02:58:28,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {49232#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49232#(< main_~i~0 995)} is VALID [2022-04-28 02:58:28,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {49239#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49232#(< main_~i~0 995)} is VALID [2022-04-28 02:58:28,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {49239#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49239#(< main_~i~0 994)} is VALID [2022-04-28 02:58:28,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {49246#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49239#(< main_~i~0 994)} is VALID [2022-04-28 02:58:28,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {49246#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49246#(< main_~i~0 993)} is VALID [2022-04-28 02:58:28,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {49253#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49246#(< main_~i~0 993)} is VALID [2022-04-28 02:58:28,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {49253#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49253#(< main_~i~0 992)} is VALID [2022-04-28 02:58:28,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {49260#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49253#(< main_~i~0 992)} is VALID [2022-04-28 02:58:28,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {49260#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49260#(< main_~i~0 991)} is VALID [2022-04-28 02:58:28,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {49267#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49260#(< main_~i~0 991)} is VALID [2022-04-28 02:58:28,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {49267#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49267#(< main_~i~0 990)} is VALID [2022-04-28 02:58:28,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {49274#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49267#(< main_~i~0 990)} is VALID [2022-04-28 02:58:28,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {49274#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49274#(< main_~i~0 989)} is VALID [2022-04-28 02:58:28,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {49281#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49274#(< main_~i~0 989)} is VALID [2022-04-28 02:58:28,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {49281#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49281#(< main_~i~0 988)} is VALID [2022-04-28 02:58:28,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {49288#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49281#(< main_~i~0 988)} is VALID [2022-04-28 02:58:28,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {49288#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49288#(< main_~i~0 987)} is VALID [2022-04-28 02:58:28,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {49295#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49288#(< main_~i~0 987)} is VALID [2022-04-28 02:58:28,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {49295#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49295#(< main_~i~0 986)} is VALID [2022-04-28 02:58:28,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {49302#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49295#(< main_~i~0 986)} is VALID [2022-04-28 02:58:28,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {49302#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49302#(< main_~i~0 985)} is VALID [2022-04-28 02:58:28,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {49302#(< main_~i~0 985)} is VALID [2022-04-28 02:58:28,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-28 02:58:28,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-28 02:58:28,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-28 02:58:28,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#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(12, 2); {48634#true} is VALID [2022-04-28 02:58:28,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-28 02:58:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:28,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945268602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:28,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:28,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-28 02:58:28,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911960864] [2022-04-28 02:58:28,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911960864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:28,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:28,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 02:58:28,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722685895] [2022-04-28 02:58:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:28,326 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 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 101 [2022-04-28 02:58:28,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:28,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:28,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 02:58:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 02:58:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 02:58:28,387 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:33,685 INFO L93 Difference]: Finished difference Result 313 states and 397 transitions. [2022-04-28 02:58:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 02:58:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 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 101 [2022-04-28 02:58:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-28 02:58:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-28 02:58:33,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 388 transitions. [2022-04-28 02:58:33,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:33,946 INFO L225 Difference]: With dead ends: 313 [2022-04-28 02:58:33,946 INFO L226 Difference]: Without dead ends: 296 [2022-04-28 02:58:33,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 02:58:33,947 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 961 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:33,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 37 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:58:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-28 02:58:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 104. [2022-04-28 02:58:34,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:34,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:34,514 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:34,516 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:34,520 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-28 02:58:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-28 02:58:34,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:34,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:34,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-28 02:58:34,521 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-28 02:58:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:34,524 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-28 02:58:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-28 02:58:34,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:34,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:34,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:34,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-28 02:58:34,525 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 101 [2022-04-28 02:58:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:34,525 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-28 02:58:34,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:34,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-28 02:58:34,712 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-28 02:58:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-28 02:58:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 02:58:34,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:34,712 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:34,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 02:58:34,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:34,929 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 81 times [2022-04-28 02:58:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:34,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447858860] [2022-04-28 02:58:34,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:34,934 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:34,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 82 times [2022-04-28 02:58:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:34,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010454526] [2022-04-28 02:58:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:35,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {50878#(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(12, 2); {50832#true} is VALID [2022-04-28 02:58:35,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-28 02:58:35,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-28 02:58:35,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:35,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {50878#(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(12, 2); {50832#true} is VALID [2022-04-28 02:58:35,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-28 02:58:35,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-28 02:58:35,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-28 02:58:35,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50837#(= main_~i~0 0)} is VALID [2022-04-28 02:58:35,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {50837#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50837#(= main_~i~0 0)} is VALID [2022-04-28 02:58:35,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {50837#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:35,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:35,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:35,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:35,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:35,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:35,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:35,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:35,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:35,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:35,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:35,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:35,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:35,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:35,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:35,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:35,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:35,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:35,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:35,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:35,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:35,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:35,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:35,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:35,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:35,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:35,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:35,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:35,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:35,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:35,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:35,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:35,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:35,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:35,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:35,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:35,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:35,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:35,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:35,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:35,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:35,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:35,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:35,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:35,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:35,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:35,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:35,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:35,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:35,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:35,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:35,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:35,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:35,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:35,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:35,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:35,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:35,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:35,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:35,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:35,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:35,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:35,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:35,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:35,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:35,674 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:35,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:35,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:35,675 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:35,675 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:35,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:35,676 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:35,676 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:35,676 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:35,677 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:35,677 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:35,677 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:35,678 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:35,678 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:35,678 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-28 02:58:35,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-28 02:58:35,678 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-28 02:58:35,679 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-28 02:58:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:35,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010454526] [2022-04-28 02:58:35,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010454526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:35,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814611915] [2022-04-28 02:58:35,680 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:58:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:35,681 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:35,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 02:58:35,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:58:35,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:35,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 02:58:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:35,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:36,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-28 02:58:36,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#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(12, 2); {50832#true} is VALID [2022-04-28 02:58:36,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-28 02:58:36,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-28 02:58:36,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-28 02:58:36,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50897#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:36,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {50897#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50897#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:36,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {50897#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:36,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:36,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:36,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:36,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:36,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:36,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:36,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:36,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:36,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:36,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:36,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:36,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:36,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:36,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:36,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:36,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:36,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:36,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:36,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:36,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:36,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:36,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:36,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:36,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:36,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:36,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:36,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:36,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:36,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:36,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:36,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:36,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:36,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:36,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:36,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:36,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:36,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:36,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:36,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:36,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:36,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:36,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:36,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:36,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:36,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:36,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:36,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:36,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:36,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:36,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:36,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:36,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:36,575 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:36,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:36,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:36,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:36,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:36,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:36,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:36,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:36,578 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:36,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:36,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:36,579 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:36,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:36,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:36,580 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:36,580 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:36,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:36,581 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:36,581 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:36,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:36,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:36,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:36,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:36,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:36,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:36,583 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:36,584 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-28 02:58:36,585 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-28 02:58:36,585 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-28 02:58:36,585 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-28 02:58:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:36,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:38,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 86: Hoare triple {51237#(< main_~i~0 1024)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-28 02:58:38,129 INFO L290 TraceCheckUtils]: 85: Hoare triple {51241#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51237#(< main_~i~0 1024)} is VALID [2022-04-28 02:58:38,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {51241#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51241#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:38,130 INFO L290 TraceCheckUtils]: 83: Hoare triple {51248#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51241#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:38,130 INFO L290 TraceCheckUtils]: 82: Hoare triple {51248#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51248#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:38,130 INFO L290 TraceCheckUtils]: 81: Hoare triple {51255#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51248#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:38,131 INFO L290 TraceCheckUtils]: 80: Hoare triple {51255#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51255#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:38,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {51262#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51255#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:38,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {51262#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51262#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:38,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {51269#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51262#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:38,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {51269#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51269#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:38,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {51276#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51269#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:38,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {51276#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51276#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:38,132 INFO L290 TraceCheckUtils]: 73: Hoare triple {51283#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51276#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:38,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {51283#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51283#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:38,133 INFO L290 TraceCheckUtils]: 71: Hoare triple {51290#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51283#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:38,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {51290#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51290#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:38,133 INFO L290 TraceCheckUtils]: 69: Hoare triple {51297#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51290#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:38,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {51297#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51297#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:38,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {51304#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51297#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:38,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {51304#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51304#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:38,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {51311#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51304#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:38,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {51311#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51311#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:38,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {51318#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51311#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:38,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {51318#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51318#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:38,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {51325#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51318#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:38,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {51325#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51325#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:38,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {51332#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51325#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:38,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {51332#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51332#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:38,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {51339#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51332#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:38,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {51339#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51339#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:38,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {51346#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51339#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:38,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {51346#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51346#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:38,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {51353#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51346#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:38,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {51353#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51353#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:38,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {51360#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51353#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:38,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {51360#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51360#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:38,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {51367#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51360#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:38,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {51367#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51367#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:38,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {51374#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51367#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:38,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {51374#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51374#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:38,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {51381#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51374#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:38,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {51381#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51381#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:38,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {51388#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51381#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:38,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {51388#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51388#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:38,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {51395#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51388#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:38,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {51395#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51395#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:38,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {51402#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51395#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:38,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {51402#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51402#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:38,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {51409#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51402#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:38,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {51409#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51409#(< main_~i~0 999)} is VALID [2022-04-28 02:58:38,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {51416#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51409#(< main_~i~0 999)} is VALID [2022-04-28 02:58:38,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {51416#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51416#(< main_~i~0 998)} is VALID [2022-04-28 02:58:38,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {51423#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51416#(< main_~i~0 998)} is VALID [2022-04-28 02:58:38,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {51423#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51423#(< main_~i~0 997)} is VALID [2022-04-28 02:58:38,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {51430#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51423#(< main_~i~0 997)} is VALID [2022-04-28 02:58:38,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {51430#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51430#(< main_~i~0 996)} is VALID [2022-04-28 02:58:38,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {51437#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51430#(< main_~i~0 996)} is VALID [2022-04-28 02:58:38,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {51437#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51437#(< main_~i~0 995)} is VALID [2022-04-28 02:58:38,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {51444#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51437#(< main_~i~0 995)} is VALID [2022-04-28 02:58:38,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {51444#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51444#(< main_~i~0 994)} is VALID [2022-04-28 02:58:38,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {51451#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51444#(< main_~i~0 994)} is VALID [2022-04-28 02:58:38,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {51451#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51451#(< main_~i~0 993)} is VALID [2022-04-28 02:58:38,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {51458#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51451#(< main_~i~0 993)} is VALID [2022-04-28 02:58:38,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {51458#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51458#(< main_~i~0 992)} is VALID [2022-04-28 02:58:38,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {51465#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51458#(< main_~i~0 992)} is VALID [2022-04-28 02:58:38,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {51465#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51465#(< main_~i~0 991)} is VALID [2022-04-28 02:58:38,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {51472#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51465#(< main_~i~0 991)} is VALID [2022-04-28 02:58:38,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {51472#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51472#(< main_~i~0 990)} is VALID [2022-04-28 02:58:38,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {51479#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51472#(< main_~i~0 990)} is VALID [2022-04-28 02:58:38,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {51479#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51479#(< main_~i~0 989)} is VALID [2022-04-28 02:58:38,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {51486#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51479#(< main_~i~0 989)} is VALID [2022-04-28 02:58:38,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {51486#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51486#(< main_~i~0 988)} is VALID [2022-04-28 02:58:38,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {51493#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51486#(< main_~i~0 988)} is VALID [2022-04-28 02:58:38,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {51493#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51493#(< main_~i~0 987)} is VALID [2022-04-28 02:58:38,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {51500#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51493#(< main_~i~0 987)} is VALID [2022-04-28 02:58:38,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {51500#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51500#(< main_~i~0 986)} is VALID [2022-04-28 02:58:38,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {51507#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51500#(< main_~i~0 986)} is VALID [2022-04-28 02:58:38,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {51507#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51507#(< main_~i~0 985)} is VALID [2022-04-28 02:58:38,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {51514#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51507#(< main_~i~0 985)} is VALID [2022-04-28 02:58:38,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {51514#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51514#(< main_~i~0 984)} is VALID [2022-04-28 02:58:38,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {51514#(< main_~i~0 984)} is VALID [2022-04-28 02:58:38,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-28 02:58:38,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-28 02:58:38,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-28 02:58:38,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#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(12, 2); {50832#true} is VALID [2022-04-28 02:58:38,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-28 02:58:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:38,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814611915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:38,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:38,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 02:58:38,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:38,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447858860] [2022-04-28 02:58:38,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447858860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:38,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:38,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 02:58:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106094318] [2022-04-28 02:58:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:38,150 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 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 103 [2022-04-28 02:58:38,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:38,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:38,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:38,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 02:58:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 02:58:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 02:58:38,190 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:44,101 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2022-04-28 02:58:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 02:58:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 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 103 [2022-04-28 02:58:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-28 02:58:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-28 02:58:44,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 397 transitions. [2022-04-28 02:58:44,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:44,389 INFO L225 Difference]: With dead ends: 320 [2022-04-28 02:58:44,389 INFO L226 Difference]: Without dead ends: 303 [2022-04-28 02:58:44,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 02:58:44,391 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 768 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:44,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 62 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:58:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-28 02:58:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 106. [2022-04-28 02:58:44,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:44,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,691 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,691 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:44,695 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-28 02:58:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-28 02:58:44,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:44,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:44,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-28 02:58:44,695 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-28 02:58:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:44,698 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-28 02:58:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-28 02:58:44,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:44,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:44,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:44,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-28 02:58:44,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 103 [2022-04-28 02:58:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:44,707 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-28 02:58:44,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:44,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-28 02:58:44,904 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-28 02:58:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 02:58:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 02:58:44,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:44,904 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:44,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:45,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:45,114 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 83 times [2022-04-28 02:58:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412257857] [2022-04-28 02:58:45,117 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:45,117 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:45,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 84 times [2022-04-28 02:58:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:45,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597613060] [2022-04-28 02:58:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:45,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {53125#(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(12, 2); {53078#true} is VALID [2022-04-28 02:58:45,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-28 02:58:45,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-28 02:58:45,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:45,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {53125#(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(12, 2); {53078#true} is VALID [2022-04-28 02:58:45,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-28 02:58:45,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-28 02:58:45,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-28 02:58:45,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53083#(= main_~i~0 0)} is VALID [2022-04-28 02:58:45,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {53083#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53083#(= main_~i~0 0)} is VALID [2022-04-28 02:58:45,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {53083#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:45,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {53084#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:45,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {53084#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:45,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {53085#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:45,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {53085#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53086#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:45,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {53086#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53086#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:45,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {53086#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53087#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:45,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {53087#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53087#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:45,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {53087#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53088#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:45,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {53088#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53088#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:45,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {53088#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53089#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:45,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {53089#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53089#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:45,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {53089#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53090#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:45,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {53090#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53090#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:45,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {53090#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53091#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:45,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {53091#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53091#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:45,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {53091#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53092#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:45,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {53092#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53092#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:45,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {53092#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53093#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:45,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {53093#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53093#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:45,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {53093#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53094#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:45,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {53094#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53094#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:45,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {53094#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53095#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:45,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {53095#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53095#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:45,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {53095#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53096#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:45,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {53096#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53096#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:45,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {53096#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53097#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:45,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {53097#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53097#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:45,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {53097#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53098#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:45,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {53098#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53098#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:45,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {53098#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53099#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:45,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {53099#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53099#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:45,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {53099#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53100#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:45,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {53100#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53100#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:45,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {53100#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53101#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:45,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {53101#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53101#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:45,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {53101#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53102#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:45,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {53102#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53102#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:45,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {53102#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53103#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:45,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {53103#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53103#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:45,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {53103#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53104#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:45,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {53104#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53104#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:45,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {53104#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53105#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:45,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {53105#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53105#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:45,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {53105#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53106#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:45,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {53106#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53106#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:45,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {53106#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53107#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:45,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {53107#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53107#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:45,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {53107#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53108#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:45,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {53108#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53108#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:45,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {53108#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53109#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:45,816 INFO L290 TraceCheckUtils]: 58: Hoare triple {53109#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53109#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:45,816 INFO L290 TraceCheckUtils]: 59: Hoare triple {53109#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53110#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:45,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {53110#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53110#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:45,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {53110#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53111#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:45,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {53111#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53111#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:45,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {53111#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53112#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:45,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {53112#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53112#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:45,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {53112#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53113#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:45,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {53113#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53113#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:45,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {53113#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53114#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:45,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {53114#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53114#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:45,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {53114#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53115#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:45,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {53115#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53115#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:45,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {53115#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53116#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:45,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {53116#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53116#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:45,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {53116#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53117#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:45,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {53117#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53117#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:45,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {53117#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53118#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:45,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {53118#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53118#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:45,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {53118#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53119#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:45,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {53119#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53119#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:45,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {53119#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53120#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:45,824 INFO L290 TraceCheckUtils]: 80: Hoare triple {53120#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53120#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:45,824 INFO L290 TraceCheckUtils]: 81: Hoare triple {53120#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53121#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:45,824 INFO L290 TraceCheckUtils]: 82: Hoare triple {53121#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53121#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:45,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {53121#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53122#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:45,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {53122#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53122#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:45,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {53122#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53123#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:45,826 INFO L290 TraceCheckUtils]: 86: Hoare triple {53123#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53123#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:45,826 INFO L290 TraceCheckUtils]: 87: Hoare triple {53123#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53124#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {53124#(<= main_~i~0 41)} assume !(~i~0 < 1024); {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {53079#false} ~i~0 := 0; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 90: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 91: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 93: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 94: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 95: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 96: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 97: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 98: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 99: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 100: Hoare triple {53079#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L272 TraceCheckUtils]: 101: Hoare triple {53079#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53079#false} is VALID [2022-04-28 02:58:45,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {53079#false} ~cond := #in~cond; {53079#false} is VALID [2022-04-28 02:58:45,828 INFO L290 TraceCheckUtils]: 103: Hoare triple {53079#false} assume 0 == ~cond; {53079#false} is VALID [2022-04-28 02:58:45,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-28 02:58:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597613060] [2022-04-28 02:58:45,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597613060] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775030136] [2022-04-28 02:58:45,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:58:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:45,829 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:45,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 02:58:46,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:58:46,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:46,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:58:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:46,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:46,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#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(12, 2); {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,290 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-28 02:58:46,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53396#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:46,291 INFO L290 TraceCheckUtils]: 90: Hoare triple {53396#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {53396#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:46,291 INFO L290 TraceCheckUtils]: 91: Hoare triple {53396#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53396#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:46,291 INFO L290 TraceCheckUtils]: 92: Hoare triple {53396#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53396#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:46,292 INFO L290 TraceCheckUtils]: 93: Hoare triple {53396#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:46,292 INFO L290 TraceCheckUtils]: 94: Hoare triple {53084#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:46,292 INFO L290 TraceCheckUtils]: 95: Hoare triple {53084#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:46,293 INFO L290 TraceCheckUtils]: 96: Hoare triple {53084#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53084#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:46,293 INFO L290 TraceCheckUtils]: 97: Hoare triple {53084#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:46,293 INFO L290 TraceCheckUtils]: 98: Hoare triple {53085#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:46,293 INFO L290 TraceCheckUtils]: 99: Hoare triple {53085#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:46,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {53085#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53085#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:46,294 INFO L272 TraceCheckUtils]: 101: Hoare triple {53085#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:46,295 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:46,295 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-28 02:58:46,295 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-28 02:58:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-28 02:58:46,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:46,579 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-28 02:58:46,579 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-28 02:58:46,579 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:46,580 INFO L272 TraceCheckUtils]: 101: Hoare triple {53453#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:46,580 INFO L290 TraceCheckUtils]: 100: Hoare triple {53453#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53453#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:46,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {53453#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53453#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:46,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {53453#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {53453#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:46,581 INFO L290 TraceCheckUtils]: 97: Hoare triple {53466#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53453#(<= main_~i~0 512)} is VALID [2022-04-28 02:58:46,581 INFO L290 TraceCheckUtils]: 96: Hoare triple {53466#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53466#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:46,582 INFO L290 TraceCheckUtils]: 95: Hoare triple {53466#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53466#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:46,582 INFO L290 TraceCheckUtils]: 94: Hoare triple {53466#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {53466#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:46,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {53479#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53466#(<= main_~i~0 511)} is VALID [2022-04-28 02:58:46,583 INFO L290 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53479#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:46,583 INFO L290 TraceCheckUtils]: 91: Hoare triple {53479#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53479#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:46,583 INFO L290 TraceCheckUtils]: 90: Hoare triple {53479#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {53479#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:46,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53479#(<= main_~i~0 510)} is VALID [2022-04-28 02:58:46,583 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#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(12, 2); {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-28 02:58:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-28 02:58:46,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775030136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:46,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:46,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 7] total 51 [2022-04-28 02:58:46,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:46,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412257857] [2022-04-28 02:58:46,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412257857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:46,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:46,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 02:58:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632317807] [2022-04-28 02:58:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 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 105 [2022-04-28 02:58:46,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:46,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:46,635 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-28 02:58:46,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 02:58:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 02:58:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=1416, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 02:58:46,636 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:52,311 INFO L93 Difference]: Finished difference Result 327 states and 415 transitions. [2022-04-28 02:58:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 02:58:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 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 105 [2022-04-28 02:58:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-28 02:58:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-28 02:58:52,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 406 transitions. [2022-04-28 02:58:52,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:52,603 INFO L225 Difference]: With dead ends: 327 [2022-04-28 02:58:52,603 INFO L226 Difference]: Without dead ends: 310 [2022-04-28 02:58:52,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3151, Invalid=5405, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 02:58:52,604 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 854 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:52,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 42 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:58:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-28 02:58:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 108. [2022-04-28 02:58:53,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:53,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:53,006 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:53,006 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:53,010 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-28 02:58:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-28 02:58:53,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:53,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:53,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 310 states. [2022-04-28 02:58:53,010 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 310 states. [2022-04-28 02:58:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:53,014 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-28 02:58:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-28 02:58:53,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:53,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:53,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:53,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2022-04-28 02:58:53,015 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 105 [2022-04-28 02:58:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2022-04-28 02:58:53,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:53,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 112 transitions. [2022-04-28 02:58:53,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-28 02:58:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 02:58:53,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:53,202 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:53,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 02:58:53,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 02:58:53,419 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 85 times [2022-04-28 02:58:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544813774] [2022-04-28 02:58:53,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:58:53,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:58:53,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:58:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 86 times [2022-04-28 02:58:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:53,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094582223] [2022-04-28 02:58:53,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:54,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:54,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {55383#(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(12, 2); {55335#true} is VALID [2022-04-28 02:58:54,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-28 02:58:54,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-28 02:58:54,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:54,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {55383#(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(12, 2); {55335#true} is VALID [2022-04-28 02:58:54,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-28 02:58:54,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-28 02:58:54,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-28 02:58:54,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55340#(= main_~i~0 0)} is VALID [2022-04-28 02:58:54,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {55340#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55340#(= main_~i~0 0)} is VALID [2022-04-28 02:58:54,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {55340#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:54,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:54,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:54,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:54,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:54,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:54,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:54,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:54,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:54,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:54,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:54,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:54,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:54,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:54,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:54,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:54,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:54,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:54,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:54,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:54,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:54,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:54,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:54,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:54,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:54,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:54,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:54,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:54,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:54,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:54,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:54,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:54,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:54,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:54,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:54,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:54,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:54,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:54,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:54,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:54,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:54,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:54,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:54,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:54,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:54,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:54,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:54,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:54,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:54,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:54,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:54,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:54,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:54,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:54,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:54,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:54,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:54,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:54,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:54,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:54,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:54,181 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:54,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:54,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:54,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:54,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:54,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:54,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:54,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:54,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:54,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:54,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:54,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:54,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:54,186 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:54,186 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:54,186 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:54,187 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:54,187 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:54,187 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:54,188 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:54,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:54,188 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:54,189 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:54,190 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-28 02:58:54,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-28 02:58:54,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-28 02:58:54,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-28 02:58:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094582223] [2022-04-28 02:58:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094582223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326413160] [2022-04-28 02:58:54,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:58:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:54,191 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:58:54,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 02:58:54,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:58:54,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:58:54,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 02:58:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:55,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-28 02:58:55,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#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(12, 2); {55335#true} is VALID [2022-04-28 02:58:55,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-28 02:58:55,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-28 02:58:55,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-28 02:58:55,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55402#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:55,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {55402#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55402#(<= main_~i~0 0)} is VALID [2022-04-28 02:58:55,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {55402#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:55,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-28 02:58:55,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:55,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-28 02:58:55,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:55,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-28 02:58:55,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:55,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-28 02:58:55,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:55,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-28 02:58:55,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:55,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-28 02:58:55,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:55,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-28 02:58:55,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:55,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-28 02:58:55,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:55,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-28 02:58:55,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:55,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-28 02:58:55,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:55,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-28 02:58:55,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:55,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-28 02:58:55,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:55,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-28 02:58:55,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:55,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-28 02:58:55,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:55,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-28 02:58:55,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:55,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-28 02:58:55,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:55,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-28 02:58:55,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:55,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-28 02:58:55,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:55,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-28 02:58:55,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:55,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-28 02:58:55,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:55,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-28 02:58:55,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:55,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-28 02:58:55,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:55,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-28 02:58:55,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:55,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-28 02:58:55,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:55,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-28 02:58:55,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:55,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-28 02:58:55,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:55,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-28 02:58:55,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:55,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-28 02:58:55,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:55,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-28 02:58:55,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:55,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-28 02:58:55,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:55,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-28 02:58:55,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:55,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-28 02:58:55,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:55,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-28 02:58:55,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:55,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-28 02:58:55,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:55,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-28 02:58:55,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:55,067 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-28 02:58:55,067 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:55,068 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-28 02:58:55,068 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:55,068 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-28 02:58:55,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:55,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-28 02:58:55,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:55,070 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-28 02:58:55,070 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:55,070 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:55,071 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-28 02:58:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:55,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:56,982 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-28 02:58:56,983 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-28 02:58:56,984 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-28 02:58:56,984 INFO L290 TraceCheckUtils]: 90: Hoare triple {55754#(< main_~i~0 1024)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-28 02:58:56,984 INFO L290 TraceCheckUtils]: 89: Hoare triple {55758#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55754#(< main_~i~0 1024)} is VALID [2022-04-28 02:58:56,984 INFO L290 TraceCheckUtils]: 88: Hoare triple {55758#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55758#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:56,984 INFO L290 TraceCheckUtils]: 87: Hoare triple {55765#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55758#(< main_~i~0 1023)} is VALID [2022-04-28 02:58:56,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {55765#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55765#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:56,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {55772#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55765#(< main_~i~0 1022)} is VALID [2022-04-28 02:58:56,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {55772#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55772#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:56,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {55779#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55772#(< main_~i~0 1021)} is VALID [2022-04-28 02:58:56,986 INFO L290 TraceCheckUtils]: 82: Hoare triple {55779#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55779#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:56,986 INFO L290 TraceCheckUtils]: 81: Hoare triple {55786#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55779#(< main_~i~0 1020)} is VALID [2022-04-28 02:58:56,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {55786#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55786#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:56,986 INFO L290 TraceCheckUtils]: 79: Hoare triple {55793#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55786#(< main_~i~0 1019)} is VALID [2022-04-28 02:58:56,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {55793#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55793#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:56,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {55800#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55793#(< main_~i~0 1018)} is VALID [2022-04-28 02:58:56,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {55800#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55800#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:56,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {55807#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55800#(< main_~i~0 1017)} is VALID [2022-04-28 02:58:56,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {55807#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55807#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:56,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {55814#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55807#(< main_~i~0 1016)} is VALID [2022-04-28 02:58:56,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {55814#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55814#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:56,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {55821#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55814#(< main_~i~0 1015)} is VALID [2022-04-28 02:58:56,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {55821#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55821#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:56,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {55828#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55821#(< main_~i~0 1014)} is VALID [2022-04-28 02:58:56,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {55828#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55828#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:56,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {55835#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55828#(< main_~i~0 1013)} is VALID [2022-04-28 02:58:56,989 INFO L290 TraceCheckUtils]: 66: Hoare triple {55835#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55835#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:56,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {55842#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55835#(< main_~i~0 1012)} is VALID [2022-04-28 02:58:56,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {55842#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55842#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:56,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {55849#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55842#(< main_~i~0 1011)} is VALID [2022-04-28 02:58:56,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {55849#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55849#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:56,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {55856#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55849#(< main_~i~0 1010)} is VALID [2022-04-28 02:58:56,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {55856#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55856#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:56,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {55863#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55856#(< main_~i~0 1009)} is VALID [2022-04-28 02:58:56,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {55863#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55863#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:56,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {55870#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55863#(< main_~i~0 1008)} is VALID [2022-04-28 02:58:56,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {55870#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55870#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:56,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {55877#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55870#(< main_~i~0 1007)} is VALID [2022-04-28 02:58:56,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {55877#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55877#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:56,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {55884#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55877#(< main_~i~0 1006)} is VALID [2022-04-28 02:58:56,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {55884#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55884#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:56,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {55891#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55884#(< main_~i~0 1005)} is VALID [2022-04-28 02:58:56,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {55891#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55891#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:56,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {55898#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55891#(< main_~i~0 1004)} is VALID [2022-04-28 02:58:56,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {55898#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55898#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:56,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {55905#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55898#(< main_~i~0 1003)} is VALID [2022-04-28 02:58:56,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {55905#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55905#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:56,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {55912#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55905#(< main_~i~0 1002)} is VALID [2022-04-28 02:58:56,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {55912#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55912#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:56,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {55919#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55912#(< main_~i~0 1001)} is VALID [2022-04-28 02:58:56,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {55919#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55919#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:56,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {55926#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55919#(< main_~i~0 1000)} is VALID [2022-04-28 02:58:56,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {55926#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55926#(< main_~i~0 999)} is VALID [2022-04-28 02:58:56,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {55933#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55926#(< main_~i~0 999)} is VALID [2022-04-28 02:58:56,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {55933#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55933#(< main_~i~0 998)} is VALID [2022-04-28 02:58:56,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {55940#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55933#(< main_~i~0 998)} is VALID [2022-04-28 02:58:56,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {55940#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55940#(< main_~i~0 997)} is VALID [2022-04-28 02:58:56,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {55947#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55940#(< main_~i~0 997)} is VALID [2022-04-28 02:58:56,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {55947#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55947#(< main_~i~0 996)} is VALID [2022-04-28 02:58:56,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {55954#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55947#(< main_~i~0 996)} is VALID [2022-04-28 02:58:56,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {55954#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55954#(< main_~i~0 995)} is VALID [2022-04-28 02:58:56,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {55961#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55954#(< main_~i~0 995)} is VALID [2022-04-28 02:58:56,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {55961#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55961#(< main_~i~0 994)} is VALID [2022-04-28 02:58:56,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {55968#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55961#(< main_~i~0 994)} is VALID [2022-04-28 02:58:56,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {55968#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55968#(< main_~i~0 993)} is VALID [2022-04-28 02:58:56,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {55975#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55968#(< main_~i~0 993)} is VALID [2022-04-28 02:58:56,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {55975#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55975#(< main_~i~0 992)} is VALID [2022-04-28 02:58:56,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {55982#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55975#(< main_~i~0 992)} is VALID [2022-04-28 02:58:56,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {55982#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55982#(< main_~i~0 991)} is VALID [2022-04-28 02:58:56,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {55989#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55982#(< main_~i~0 991)} is VALID [2022-04-28 02:58:56,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {55989#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55989#(< main_~i~0 990)} is VALID [2022-04-28 02:58:56,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {55996#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55989#(< main_~i~0 990)} is VALID [2022-04-28 02:58:56,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {55996#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55996#(< main_~i~0 989)} is VALID [2022-04-28 02:58:57,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {56003#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55996#(< main_~i~0 989)} is VALID [2022-04-28 02:58:57,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {56003#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56003#(< main_~i~0 988)} is VALID [2022-04-28 02:58:57,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {56010#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56003#(< main_~i~0 988)} is VALID [2022-04-28 02:58:57,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {56010#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56010#(< main_~i~0 987)} is VALID [2022-04-28 02:58:57,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {56017#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56010#(< main_~i~0 987)} is VALID [2022-04-28 02:58:57,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {56017#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56017#(< main_~i~0 986)} is VALID [2022-04-28 02:58:57,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {56024#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56017#(< main_~i~0 986)} is VALID [2022-04-28 02:58:57,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {56024#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56024#(< main_~i~0 985)} is VALID [2022-04-28 02:58:57,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {56031#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56024#(< main_~i~0 985)} is VALID [2022-04-28 02:58:57,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {56031#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56031#(< main_~i~0 984)} is VALID [2022-04-28 02:58:57,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {56038#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56031#(< main_~i~0 984)} is VALID [2022-04-28 02:58:57,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {56038#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56038#(< main_~i~0 983)} is VALID [2022-04-28 02:58:57,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {56045#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56038#(< main_~i~0 983)} is VALID [2022-04-28 02:58:57,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {56045#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56045#(< main_~i~0 982)} is VALID [2022-04-28 02:58:57,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56045#(< main_~i~0 982)} is VALID [2022-04-28 02:58:57,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-28 02:58:57,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-28 02:58:57,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-28 02:58:57,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#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(12, 2); {55335#true} is VALID [2022-04-28 02:58:57,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-28 02:58:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:58:57,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326413160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:57,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-28 02:58:57,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:57,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544813774] [2022-04-28 02:58:57,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544813774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:57,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 02:58:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758649470] [2022-04-28 02:58:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 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 107 [2022-04-28 02:58:57,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:57,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:57,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:58:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 02:58:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 02:58:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 02:58:57,085 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:02,504 INFO L93 Difference]: Finished difference Result 334 states and 424 transitions. [2022-04-28 02:59:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 02:59:02,505 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 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 107 [2022-04-28 02:59:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-28 02:59:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-28 02:59:02,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 415 transitions. [2022-04-28 02:59:02,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:02,690 INFO L225 Difference]: With dead ends: 334 [2022-04-28 02:59:02,690 INFO L226 Difference]: Without dead ends: 317 [2022-04-28 02:59:02,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 02:59:02,691 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1062 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:02,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 27 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:59:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-28 02:59:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 110. [2022-04-28 02:59:03,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:03,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:03,020 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:03,020 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:03,024 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-28 02:59:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-28 02:59:03,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:03,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:03,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-28 02:59:03,024 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 317 states. [2022-04-28 02:59:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:03,028 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-28 02:59:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-28 02:59:03,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:03,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:03,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:03,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-28 02:59:03,029 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 107 [2022-04-28 02:59:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:03,029 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-28 02:59:03,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:03,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-28 02:59:03,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-28 02:59:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 02:59:03,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:03,243 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:03,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 02:59:03,446 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 87 times [2022-04-28 02:59:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:03,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2147235057] [2022-04-28 02:59:03,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:03,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:03,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 88 times [2022-04-28 02:59:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244460203] [2022-04-28 02:59:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:04,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#(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(12, 2); {57677#true} is VALID [2022-04-28 02:59:04,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-28 02:59:04,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-28 02:59:04,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:04,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#(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(12, 2); {57677#true} is VALID [2022-04-28 02:59:04,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-28 02:59:04,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-28 02:59:04,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-28 02:59:04,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57682#(= main_~i~0 0)} is VALID [2022-04-28 02:59:04,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {57682#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57682#(= main_~i~0 0)} is VALID [2022-04-28 02:59:04,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {57682#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:04,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:04,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:04,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:04,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:04,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:04,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:04,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:04,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:04,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:04,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:04,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:04,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:04,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:04,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:04,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:04,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:04,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:04,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:04,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:04,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:04,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:04,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:04,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:04,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:04,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:04,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:04,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:04,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:04,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:04,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:04,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:04,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:04,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:04,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:04,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:04,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:04,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:04,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:04,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:04,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:04,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:04,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:04,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:04,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:04,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:04,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:04,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:04,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:04,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:04,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:04,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:04,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:04,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:04,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:04,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:04,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:04,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:04,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:04,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:04,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:04,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:04,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:04,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:04,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:04,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:04,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:04,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:04,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:04,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:04,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:04,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:04,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:04,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:04,254 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:04,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:04,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:04,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:04,255 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:04,255 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:04,255 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:04,255 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:04,256 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:04,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:04,256 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:04,256 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-28 02:59:04,257 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-28 02:59:04,258 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-28 02:59:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244460203] [2022-04-28 02:59:04,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244460203] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490087441] [2022-04-28 02:59:04,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:59:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:04,260 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:04,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 02:59:04,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:59:04,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:04,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 02:59:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:04,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:04,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-28 02:59:04,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#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(12, 2); {57677#true} is VALID [2022-04-28 02:59:04,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-28 02:59:04,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-28 02:59:04,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-28 02:59:04,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57745#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:04,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {57745#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57745#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:04,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {57745#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:04,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:04,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:04,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:04,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:04,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:04,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:04,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:04,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:04,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:04,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:04,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:04,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:04,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:04,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:04,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:04,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:04,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:04,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:04,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:04,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:04,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:04,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:04,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:04,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:04,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:04,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:04,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:04,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:04,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:04,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:04,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:04,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:04,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:04,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:04,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:04,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:04,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:04,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:04,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:04,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:04,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:04,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:04,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:04,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:04,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:04,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:04,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:04,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:04,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:04,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:04,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:04,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:04,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:04,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:04,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:04,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:04,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:04,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:04,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:04,898 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:04,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:04,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:04,899 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:04,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:04,899 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:04,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:04,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:04,900 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:04,900 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:04,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:04,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:04,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:04,901 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:04,901 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:04,901 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:04,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:04,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:04,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:04,902 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:04,902 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:04,903 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:04,903 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:04,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:04,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:04,904 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-28 02:59:04,905 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-28 02:59:04,905 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-28 02:59:04,905 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-28 02:59:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:04,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:06,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-28 02:59:06,743 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-28 02:59:06,743 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-28 02:59:06,743 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-28 02:59:06,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {58103#(< main_~i~0 1024)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-28 02:59:06,745 INFO L290 TraceCheckUtils]: 91: Hoare triple {58107#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58103#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:06,745 INFO L290 TraceCheckUtils]: 90: Hoare triple {58107#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58107#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:06,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {58114#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58107#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:06,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {58114#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58114#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:06,746 INFO L290 TraceCheckUtils]: 87: Hoare triple {58121#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58114#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:06,746 INFO L290 TraceCheckUtils]: 86: Hoare triple {58121#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58121#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:06,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {58128#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58121#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:06,746 INFO L290 TraceCheckUtils]: 84: Hoare triple {58128#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58128#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:06,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {58135#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58128#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:06,747 INFO L290 TraceCheckUtils]: 82: Hoare triple {58135#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58135#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:06,747 INFO L290 TraceCheckUtils]: 81: Hoare triple {58142#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58135#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:06,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {58142#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58142#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:06,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {58149#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58142#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:06,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {58149#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58149#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:06,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {58156#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58149#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:06,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {58156#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58156#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:06,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {58163#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58156#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:06,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {58163#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58163#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:06,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {58170#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58163#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:06,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {58170#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58170#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:06,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {58177#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58170#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:06,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {58177#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58177#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:06,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {58184#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58177#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:06,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {58184#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58184#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:06,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {58191#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58184#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:06,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {58191#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58191#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:06,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {58198#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58191#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:06,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {58198#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58198#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:06,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {58205#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58198#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:06,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {58205#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58205#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:06,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {58212#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58205#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:06,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {58212#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58212#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:06,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {58219#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58212#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:06,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {58219#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58219#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:06,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {58226#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58219#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:06,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {58226#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58226#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:06,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {58233#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58226#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:06,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {58233#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58233#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:06,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {58240#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58233#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:06,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {58240#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58240#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:06,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {58247#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58240#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:06,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {58247#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58247#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:06,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {58254#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58247#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:06,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {58254#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58254#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:06,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {58261#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58254#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:06,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {58261#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58261#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:06,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {58268#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58261#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:06,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {58268#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58268#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:06,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {58275#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58268#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:06,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {58275#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58275#(< main_~i~0 999)} is VALID [2022-04-28 02:59:06,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {58282#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58275#(< main_~i~0 999)} is VALID [2022-04-28 02:59:06,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {58282#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58282#(< main_~i~0 998)} is VALID [2022-04-28 02:59:06,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {58289#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58282#(< main_~i~0 998)} is VALID [2022-04-28 02:59:06,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {58289#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58289#(< main_~i~0 997)} is VALID [2022-04-28 02:59:06,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {58296#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58289#(< main_~i~0 997)} is VALID [2022-04-28 02:59:06,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {58296#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58296#(< main_~i~0 996)} is VALID [2022-04-28 02:59:06,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {58303#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58296#(< main_~i~0 996)} is VALID [2022-04-28 02:59:06,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {58303#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58303#(< main_~i~0 995)} is VALID [2022-04-28 02:59:06,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {58310#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58303#(< main_~i~0 995)} is VALID [2022-04-28 02:59:06,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {58310#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58310#(< main_~i~0 994)} is VALID [2022-04-28 02:59:06,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {58317#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58310#(< main_~i~0 994)} is VALID [2022-04-28 02:59:06,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {58317#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58317#(< main_~i~0 993)} is VALID [2022-04-28 02:59:06,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {58324#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58317#(< main_~i~0 993)} is VALID [2022-04-28 02:59:06,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {58324#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58324#(< main_~i~0 992)} is VALID [2022-04-28 02:59:06,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {58331#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58324#(< main_~i~0 992)} is VALID [2022-04-28 02:59:06,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {58331#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58331#(< main_~i~0 991)} is VALID [2022-04-28 02:59:06,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {58338#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58331#(< main_~i~0 991)} is VALID [2022-04-28 02:59:06,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {58338#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58338#(< main_~i~0 990)} is VALID [2022-04-28 02:59:06,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {58345#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58338#(< main_~i~0 990)} is VALID [2022-04-28 02:59:06,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {58345#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58345#(< main_~i~0 989)} is VALID [2022-04-28 02:59:06,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {58352#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58345#(< main_~i~0 989)} is VALID [2022-04-28 02:59:06,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {58352#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58352#(< main_~i~0 988)} is VALID [2022-04-28 02:59:06,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {58359#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58352#(< main_~i~0 988)} is VALID [2022-04-28 02:59:06,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {58359#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58359#(< main_~i~0 987)} is VALID [2022-04-28 02:59:06,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {58366#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58359#(< main_~i~0 987)} is VALID [2022-04-28 02:59:06,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {58366#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58366#(< main_~i~0 986)} is VALID [2022-04-28 02:59:06,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {58373#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58366#(< main_~i~0 986)} is VALID [2022-04-28 02:59:06,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {58373#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58373#(< main_~i~0 985)} is VALID [2022-04-28 02:59:06,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {58380#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58373#(< main_~i~0 985)} is VALID [2022-04-28 02:59:06,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {58380#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58380#(< main_~i~0 984)} is VALID [2022-04-28 02:59:06,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {58387#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58380#(< main_~i~0 984)} is VALID [2022-04-28 02:59:06,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {58387#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58387#(< main_~i~0 983)} is VALID [2022-04-28 02:59:06,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {58394#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58387#(< main_~i~0 983)} is VALID [2022-04-28 02:59:06,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {58394#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58394#(< main_~i~0 982)} is VALID [2022-04-28 02:59:06,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {58401#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58394#(< main_~i~0 982)} is VALID [2022-04-28 02:59:06,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {58401#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58401#(< main_~i~0 981)} is VALID [2022-04-28 02:59:06,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {58401#(< main_~i~0 981)} is VALID [2022-04-28 02:59:06,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-28 02:59:06,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-28 02:59:06,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-28 02:59:06,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#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(12, 2); {57677#true} is VALID [2022-04-28 02:59:06,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-28 02:59:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490087441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:06,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 02:59:06,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:06,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2147235057] [2022-04-28 02:59:06,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2147235057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:06,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:06,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 02:59:06,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538976666] [2022-04-28 02:59:06,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 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 109 [2022-04-28 02:59:06,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:06,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:06,810 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-28 02:59:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 02:59:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 02:59:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 02:59:06,811 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:13,532 INFO L93 Difference]: Finished difference Result 341 states and 433 transitions. [2022-04-28 02:59:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 02:59:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 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 109 [2022-04-28 02:59:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-28 02:59:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-28 02:59:13,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 424 transitions. [2022-04-28 02:59:13,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 424 edges. 424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:13,836 INFO L225 Difference]: With dead ends: 341 [2022-04-28 02:59:13,836 INFO L226 Difference]: Without dead ends: 324 [2022-04-28 02:59:13,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 02:59:13,837 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:13,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 32 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:59:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-28 02:59:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 112. [2022-04-28 02:59:14,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:14,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:14,415 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:14,415 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:14,419 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-28 02:59:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-28 02:59:14,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:14,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:14,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-28 02:59:14,419 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 324 states. [2022-04-28 02:59:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:14,423 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-28 02:59:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-28 02:59:14,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:14,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:14,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:14,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-04-28 02:59:14,424 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 109 [2022-04-28 02:59:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:14,425 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-04-28 02:59:14,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:14,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 116 transitions. [2022-04-28 02:59:14,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-04-28 02:59:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 02:59:14,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:14,634 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:14,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-28 02:59:14,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 02:59:14,839 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 89 times [2022-04-28 02:59:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:14,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779802364] [2022-04-28 02:59:14,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:14,847 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:14,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 90 times [2022-04-28 02:59:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:14,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865568298] [2022-04-28 02:59:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:15,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {60117#(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(12, 2); {60067#true} is VALID [2022-04-28 02:59:15,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-28 02:59:15,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-28 02:59:15,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:15,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {60117#(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(12, 2); {60067#true} is VALID [2022-04-28 02:59:15,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-28 02:59:15,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-28 02:59:15,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-28 02:59:15,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60072#(= main_~i~0 0)} is VALID [2022-04-28 02:59:15,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {60072#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60072#(= main_~i~0 0)} is VALID [2022-04-28 02:59:15,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {60072#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {60073#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {60073#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {60074#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {60074#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60075#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:15,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {60075#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60075#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:15,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {60075#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60076#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:15,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {60076#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60076#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:15,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {60076#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60077#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:15,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {60077#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60077#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:15,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {60077#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60078#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:15,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {60078#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60078#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:15,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {60078#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60079#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:15,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {60079#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60079#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:15,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {60079#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60080#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:15,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {60080#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60080#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:15,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {60080#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60081#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:15,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {60081#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60081#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:15,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {60081#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60082#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:15,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {60082#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60082#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:15,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {60082#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60083#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:15,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {60083#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60083#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:15,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {60083#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60084#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:15,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {60084#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60084#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:15,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {60084#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60085#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:15,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {60085#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60085#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:15,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {60085#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60086#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:15,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {60086#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60086#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:15,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {60086#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60087#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:15,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {60087#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60087#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:15,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {60087#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60088#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:15,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {60088#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60088#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:15,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {60088#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60089#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:15,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {60089#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60089#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:15,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {60089#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60090#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:15,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {60090#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60090#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:15,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {60090#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60091#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:15,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {60091#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60091#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:15,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {60091#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60092#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:15,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {60092#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60092#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:15,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {60092#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60093#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:15,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {60093#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60093#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:15,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {60093#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60094#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:15,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {60094#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60094#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:15,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {60094#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60095#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:15,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {60095#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60095#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:15,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {60095#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60096#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:15,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {60096#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60096#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:15,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {60096#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60097#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:15,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {60097#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60097#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:15,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {60097#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60098#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:15,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {60098#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60098#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:15,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {60098#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60099#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:15,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {60099#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60099#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:15,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {60099#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60100#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:15,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {60100#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60100#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:15,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {60100#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60101#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:15,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {60101#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60101#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:15,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {60101#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60102#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:15,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {60102#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60102#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:15,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {60102#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60103#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:15,429 INFO L290 TraceCheckUtils]: 68: Hoare triple {60103#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60103#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:15,429 INFO L290 TraceCheckUtils]: 69: Hoare triple {60103#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60104#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:15,429 INFO L290 TraceCheckUtils]: 70: Hoare triple {60104#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60104#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:15,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {60104#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60105#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:15,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {60105#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60105#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:15,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {60105#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60106#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:15,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {60106#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60106#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:15,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {60106#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60107#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:15,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {60107#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60107#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:15,431 INFO L290 TraceCheckUtils]: 77: Hoare triple {60107#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60108#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:15,431 INFO L290 TraceCheckUtils]: 78: Hoare triple {60108#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60108#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:15,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {60108#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60109#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:15,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {60109#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60109#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:15,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {60109#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60110#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:15,432 INFO L290 TraceCheckUtils]: 82: Hoare triple {60110#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60110#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:15,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {60110#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60111#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:15,433 INFO L290 TraceCheckUtils]: 84: Hoare triple {60111#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60111#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:15,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {60111#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60112#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:15,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {60112#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60112#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:15,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {60112#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60113#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:15,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {60113#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60113#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:15,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {60113#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60114#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:15,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {60114#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60114#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:15,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {60114#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60115#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:15,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {60115#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60115#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 93: Hoare triple {60115#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60116#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 94: Hoare triple {60116#(<= main_~i~0 44)} assume !(~i~0 < 1024); {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 95: Hoare triple {60068#false} ~i~0 := 0; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 96: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 97: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 98: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 99: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 100: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 101: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 102: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 103: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 104: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-28 02:59:15,435 INFO L290 TraceCheckUtils]: 105: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L290 TraceCheckUtils]: 106: Hoare triple {60068#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L272 TraceCheckUtils]: 107: Hoare triple {60068#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L290 TraceCheckUtils]: 108: Hoare triple {60068#false} ~cond := #in~cond; {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L290 TraceCheckUtils]: 109: Hoare triple {60068#false} assume 0 == ~cond; {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-28 02:59:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:15,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865568298] [2022-04-28 02:59:15,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865568298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:15,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230931886] [2022-04-28 02:59:15,436 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:15,438 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:15,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 02:59:15,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:59:15,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:15,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:59:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:15,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:15,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#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(12, 2); {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-28 02:59:15,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-28 02:59:15,841 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60406#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:15,842 INFO L290 TraceCheckUtils]: 96: Hoare triple {60406#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {60406#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:15,842 INFO L290 TraceCheckUtils]: 97: Hoare triple {60406#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60406#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:15,842 INFO L290 TraceCheckUtils]: 98: Hoare triple {60406#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60406#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:15,842 INFO L290 TraceCheckUtils]: 99: Hoare triple {60406#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {60073#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {60073#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {60073#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60073#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:15,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {60073#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {60074#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {60074#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {60074#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60074#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:15,844 INFO L272 TraceCheckUtils]: 107: Hoare triple {60074#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:15,844 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:15,845 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-28 02:59:15,845 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-28 02:59:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-28 02:59:15,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:16,021 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-28 02:59:16,021 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-28 02:59:16,022 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:16,022 INFO L272 TraceCheckUtils]: 107: Hoare triple {60463#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:16,023 INFO L290 TraceCheckUtils]: 106: Hoare triple {60463#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60463#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:16,023 INFO L290 TraceCheckUtils]: 105: Hoare triple {60463#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60463#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:16,023 INFO L290 TraceCheckUtils]: 104: Hoare triple {60463#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {60463#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:16,023 INFO L290 TraceCheckUtils]: 103: Hoare triple {60476#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60463#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:16,024 INFO L290 TraceCheckUtils]: 102: Hoare triple {60476#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60476#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:16,024 INFO L290 TraceCheckUtils]: 101: Hoare triple {60476#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60476#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:16,024 INFO L290 TraceCheckUtils]: 100: Hoare triple {60476#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {60476#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:16,024 INFO L290 TraceCheckUtils]: 99: Hoare triple {60489#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60476#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:16,024 INFO L290 TraceCheckUtils]: 98: Hoare triple {60489#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60489#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 97: Hoare triple {60489#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60489#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 96: Hoare triple {60489#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {60489#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60489#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,025 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#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(12, 2); {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-28 02:59:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-28 02:59:16,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230931886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:16,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 7, 7] total 54 [2022-04-28 02:59:16,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:16,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779802364] [2022-04-28 02:59:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779802364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 02:59:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529278664] [2022-04-28 02:59:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 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 111 [2022-04-28 02:59:16,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:16,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:16,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:16,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 02:59:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 02:59:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=1581, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:59:16,076 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:22,396 INFO L93 Difference]: Finished difference Result 348 states and 442 transitions. [2022-04-28 02:59:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 02:59:22,396 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 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 111 [2022-04-28 02:59:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-28 02:59:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-28 02:59:22,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 433 transitions. [2022-04-28 02:59:22,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:22,656 INFO L225 Difference]: With dead ends: 348 [2022-04-28 02:59:22,656 INFO L226 Difference]: Without dead ends: 331 [2022-04-28 02:59:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3577, Invalid=6125, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 02:59:22,657 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1151 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:22,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 42 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:59:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-28 02:59:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 114. [2022-04-28 02:59:23,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:23,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,079 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,079 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:23,082 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-28 02:59:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-28 02:59:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:23,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 02:59:23,083 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 02:59:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:23,087 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-28 02:59:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-28 02:59:23,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:23,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:23,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:23,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-04-28 02:59:23,088 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 111 [2022-04-28 02:59:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:23,088 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-04-28 02:59:23,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:23,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 118 transitions. [2022-04-28 02:59:23,336 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-28 02:59:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-28 02:59:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 02:59:23,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:23,337 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:23,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:23,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:23,546 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 91 times [2022-04-28 02:59:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:23,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576686466] [2022-04-28 02:59:23,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:23,558 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:23,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 92 times [2022-04-28 02:59:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:23,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724744812] [2022-04-28 02:59:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {62516#(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(12, 2); {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:24,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {62516#(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(12, 2); {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-28 02:59:24,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-28 02:59:24,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62470#(= main_~i~0 0)} is VALID [2022-04-28 02:59:24,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {62470#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62470#(= main_~i~0 0)} is VALID [2022-04-28 02:59:24,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {62470#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:24,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:24,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:24,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:24,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:24,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:24,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:24,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:24,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:24,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:24,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:24,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:24,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:24,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:24,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:24,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:24,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:24,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:24,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:24,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:24,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:24,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:24,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:24,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:24,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:24,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:24,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:24,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:24,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:24,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:24,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:24,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:24,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:24,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:24,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:24,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:24,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:24,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:24,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:24,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:24,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:24,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:24,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:24,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:24,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:24,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:24,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:24,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:24,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:24,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:24,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:24,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:24,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:24,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:24,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:24,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:24,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:24,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:24,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:24,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:24,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:24,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:24,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:24,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:24,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:24,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:24,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:24,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:24,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:24,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:24,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:24,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:24,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:24,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:24,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:24,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:24,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:24,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:24,418 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:24,418 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:24,418 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:24,418 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:24,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:24,419 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:24,419 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:24,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:24,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:24,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:24,421 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-28 02:59:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724744812] [2022-04-28 02:59:24,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724744812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242233193] [2022-04-28 02:59:24,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:24,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:24,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:24,427 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:24,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 02:59:24,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:24,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:24,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 02:59:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:25,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-28 02:59:25,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#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(12, 2); {62465#true} is VALID [2022-04-28 02:59:25,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-28 02:59:25,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-28 02:59:25,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-28 02:59:25,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62535#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:25,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {62535#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62535#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:25,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {62535#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:25,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:25,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:25,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:25,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:25,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:25,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:25,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:25,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:25,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:25,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:25,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:25,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:25,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:25,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:25,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:25,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:25,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:25,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:25,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:25,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:25,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:25,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:25,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:25,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:25,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:25,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:25,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:25,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:25,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:25,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:25,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:25,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:25,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:25,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:25,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:25,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:25,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:25,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:25,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:25,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:25,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:25,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:25,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:25,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:25,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:25,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:25,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:25,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:25,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:25,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:25,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:25,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:25,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:25,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:25,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:25,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:25,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:25,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:25,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:25,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:25,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:25,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:25,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:25,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:25,339 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:25,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:25,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:25,340 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:25,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:25,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:25,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:25,341 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:25,341 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:25,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:25,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:25,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:25,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:25,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:25,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:25,343 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:25,343 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:25,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:25,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:25,344 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:25,344 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:25,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:25,344 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:25,345 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-28 02:59:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:25,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:27,608 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-28 02:59:27,608 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-28 02:59:27,608 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-28 02:59:27,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-28 02:59:27,610 INFO L290 TraceCheckUtils]: 96: Hoare triple {62905#(< main_~i~0 1024)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-28 02:59:27,610 INFO L290 TraceCheckUtils]: 95: Hoare triple {62909#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62905#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:27,611 INFO L290 TraceCheckUtils]: 94: Hoare triple {62909#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62909#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:27,611 INFO L290 TraceCheckUtils]: 93: Hoare triple {62916#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62909#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:27,611 INFO L290 TraceCheckUtils]: 92: Hoare triple {62916#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62916#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:27,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {62923#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62916#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:27,612 INFO L290 TraceCheckUtils]: 90: Hoare triple {62923#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62923#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:27,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {62930#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62923#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:27,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {62930#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62930#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:27,613 INFO L290 TraceCheckUtils]: 87: Hoare triple {62937#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62930#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:27,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {62937#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62937#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:27,613 INFO L290 TraceCheckUtils]: 85: Hoare triple {62944#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62937#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:27,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {62944#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62944#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:27,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {62951#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62944#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:27,614 INFO L290 TraceCheckUtils]: 82: Hoare triple {62951#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62951#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:27,615 INFO L290 TraceCheckUtils]: 81: Hoare triple {62958#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62951#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:27,615 INFO L290 TraceCheckUtils]: 80: Hoare triple {62958#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62958#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:27,615 INFO L290 TraceCheckUtils]: 79: Hoare triple {62965#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62958#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:27,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {62965#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62965#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:27,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {62972#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62965#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:27,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {62972#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62972#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:27,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {62979#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62972#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:27,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {62979#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62979#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:27,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {62986#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62979#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:27,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {62986#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62986#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:27,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {62993#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62986#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:27,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {62993#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62993#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:27,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {63000#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62993#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:27,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {63000#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63000#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:27,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {63007#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63000#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:27,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {63007#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63007#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:27,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {63014#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63007#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:27,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {63014#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63014#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:27,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {63021#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63014#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:27,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {63021#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63021#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:27,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {63028#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63021#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:27,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {63028#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63028#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:27,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {63035#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63028#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:27,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {63035#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63035#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:27,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {63042#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63035#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:27,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {63042#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63042#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:27,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {63049#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63042#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:27,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {63049#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63049#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:27,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {63056#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63049#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:27,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {63056#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63056#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:27,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {63063#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63056#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:27,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {63063#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63063#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:27,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {63070#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63063#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:27,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {63070#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63070#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:27,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {63077#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63070#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:27,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {63077#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63077#(< main_~i~0 999)} is VALID [2022-04-28 02:59:27,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {63084#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63077#(< main_~i~0 999)} is VALID [2022-04-28 02:59:27,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {63084#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63084#(< main_~i~0 998)} is VALID [2022-04-28 02:59:27,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {63091#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63084#(< main_~i~0 998)} is VALID [2022-04-28 02:59:27,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {63091#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63091#(< main_~i~0 997)} is VALID [2022-04-28 02:59:27,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {63098#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63091#(< main_~i~0 997)} is VALID [2022-04-28 02:59:27,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {63098#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63098#(< main_~i~0 996)} is VALID [2022-04-28 02:59:27,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {63105#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63098#(< main_~i~0 996)} is VALID [2022-04-28 02:59:27,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {63105#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63105#(< main_~i~0 995)} is VALID [2022-04-28 02:59:27,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {63112#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63105#(< main_~i~0 995)} is VALID [2022-04-28 02:59:27,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {63112#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63112#(< main_~i~0 994)} is VALID [2022-04-28 02:59:27,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {63119#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63112#(< main_~i~0 994)} is VALID [2022-04-28 02:59:27,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {63119#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63119#(< main_~i~0 993)} is VALID [2022-04-28 02:59:27,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {63126#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63119#(< main_~i~0 993)} is VALID [2022-04-28 02:59:27,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {63126#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63126#(< main_~i~0 992)} is VALID [2022-04-28 02:59:27,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {63133#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63126#(< main_~i~0 992)} is VALID [2022-04-28 02:59:27,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {63133#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63133#(< main_~i~0 991)} is VALID [2022-04-28 02:59:27,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {63140#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63133#(< main_~i~0 991)} is VALID [2022-04-28 02:59:27,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {63140#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63140#(< main_~i~0 990)} is VALID [2022-04-28 02:59:27,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {63147#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63140#(< main_~i~0 990)} is VALID [2022-04-28 02:59:27,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {63147#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63147#(< main_~i~0 989)} is VALID [2022-04-28 02:59:27,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {63154#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63147#(< main_~i~0 989)} is VALID [2022-04-28 02:59:27,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {63154#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63154#(< main_~i~0 988)} is VALID [2022-04-28 02:59:27,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {63161#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63154#(< main_~i~0 988)} is VALID [2022-04-28 02:59:27,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {63161#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63161#(< main_~i~0 987)} is VALID [2022-04-28 02:59:27,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {63168#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63161#(< main_~i~0 987)} is VALID [2022-04-28 02:59:27,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {63168#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63168#(< main_~i~0 986)} is VALID [2022-04-28 02:59:27,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {63175#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63168#(< main_~i~0 986)} is VALID [2022-04-28 02:59:27,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {63175#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63175#(< main_~i~0 985)} is VALID [2022-04-28 02:59:27,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {63182#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63175#(< main_~i~0 985)} is VALID [2022-04-28 02:59:27,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {63182#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63182#(< main_~i~0 984)} is VALID [2022-04-28 02:59:27,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {63189#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63182#(< main_~i~0 984)} is VALID [2022-04-28 02:59:27,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {63189#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63189#(< main_~i~0 983)} is VALID [2022-04-28 02:59:27,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {63196#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63189#(< main_~i~0 983)} is VALID [2022-04-28 02:59:27,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {63196#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63196#(< main_~i~0 982)} is VALID [2022-04-28 02:59:27,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {63203#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63196#(< main_~i~0 982)} is VALID [2022-04-28 02:59:27,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {63203#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63203#(< main_~i~0 981)} is VALID [2022-04-28 02:59:27,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {63210#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63203#(< main_~i~0 981)} is VALID [2022-04-28 02:59:27,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {63210#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63210#(< main_~i~0 980)} is VALID [2022-04-28 02:59:27,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {63217#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63210#(< main_~i~0 980)} is VALID [2022-04-28 02:59:27,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {63217#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63217#(< main_~i~0 979)} is VALID [2022-04-28 02:59:27,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63217#(< main_~i~0 979)} is VALID [2022-04-28 02:59:27,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-28 02:59:27,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-28 02:59:27,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-28 02:59:27,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#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(12, 2); {62465#true} is VALID [2022-04-28 02:59:27,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-28 02:59:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:27,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242233193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:27,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:27,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 02:59:27,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:27,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576686466] [2022-04-28 02:59:27,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576686466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:27,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:27,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 02:59:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356204920] [2022-04-28 02:59:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 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 113 [2022-04-28 02:59:27,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:27,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:27,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:27,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 02:59:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 02:59:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 02:59:27,726 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:34,080 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2022-04-28 02:59:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 02:59:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 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 113 [2022-04-28 02:59:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-28 02:59:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-28 02:59:34,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 442 transitions. [2022-04-28 02:59:34,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:34,341 INFO L225 Difference]: With dead ends: 355 [2022-04-28 02:59:34,342 INFO L226 Difference]: Without dead ends: 338 [2022-04-28 02:59:34,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 02:59:34,343 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1008 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:34,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:59:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-28 02:59:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-04-28 02:59:35,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:35,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:35,013 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:35,013 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:35,017 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-28 02:59:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-28 02:59:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:35,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:35,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 02:59:35,017 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 02:59:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:35,021 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-28 02:59:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-28 02:59:35,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:35,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:35,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:35,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-28 02:59:35,022 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 113 [2022-04-28 02:59:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:35,023 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-28 02:59:35,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:35,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-28 02:59:35,269 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-28 02:59:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 02:59:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 02:59:35,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:35,270 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:35,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 02:59:35,476 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 93 times [2022-04-28 02:59:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:35,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952450250] [2022-04-28 02:59:35,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:35,480 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:35,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 94 times [2022-04-28 02:59:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465942472] [2022-04-28 02:59:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:36,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {65003#(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(12, 2); {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {65003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {65003#(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(12, 2); {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-28 02:59:36,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {64956#(= main_~i~0 0)} is VALID [2022-04-28 02:59:36,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {64956#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64956#(= main_~i~0 0)} is VALID [2022-04-28 02:59:36,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {64956#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:36,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:36,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:36,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:36,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:36,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:36,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:36,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:36,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:36,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:36,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:36,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:36,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:36,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:36,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:36,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:36,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:36,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:36,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:36,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:36,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:36,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:36,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:36,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:36,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:36,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:36,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:36,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:36,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:36,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:36,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:36,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:36,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:36,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:36,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:36,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:36,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:36,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:36,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:36,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:36,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:36,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:36,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:36,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:36,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:36,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:36,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:36,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:36,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:36,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:36,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:36,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:36,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:36,150 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:36,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:36,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:36,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:36,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:36,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:36,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:36,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:36,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:36,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:36,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:36,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:36,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:36,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:36,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:36,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:36,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:36,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:36,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:36,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:36,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:36,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:36,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:36,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:36,156 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:36,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:36,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:36,156 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:36,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:36,157 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:36,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:36,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:36,157 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:36,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:36,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:36,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:36,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:36,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-28 02:59:36,159 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-28 02:59:36,160 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-28 02:59:36,160 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-28 02:59:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465942472] [2022-04-28 02:59:36,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465942472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:36,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622986295] [2022-04-28 02:59:36,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:59:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:36,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:36,161 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:36,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 02:59:36,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:59:36,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:36,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 02:59:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:36,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:36,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-28 02:59:36,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#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(12, 2); {64951#true} is VALID [2022-04-28 02:59:36,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-28 02:59:36,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-28 02:59:36,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-28 02:59:36,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65022#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:36,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {65022#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65022#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:36,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {65022#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:36,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:36,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:36,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:36,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:36,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:36,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:36,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:36,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:36,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:36,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:36,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:36,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:36,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:36,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:36,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:36,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:36,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:36,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:36,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:36,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:36,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:36,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:36,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:36,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:36,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:36,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:36,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:36,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:36,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:36,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:36,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:36,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:36,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:36,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:36,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:36,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:36,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:36,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:36,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:36,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:36,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:36,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:36,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:36,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:36,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:36,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:36,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:36,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:36,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:36,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:36,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:36,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:36,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:36,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:36,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:36,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:36,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:36,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:36,892 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:36,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:36,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:36,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:36,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:36,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:36,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:36,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:36,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:36,895 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:36,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:36,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:36,896 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:36,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:36,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:36,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:36,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:36,898 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:36,898 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:36,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:36,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:36,899 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:36,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:36,900 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:36,900 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:36,900 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:36,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:36,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:36,901 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:36,902 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:36,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:36,902 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:36,903 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-28 02:59:36,904 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-28 02:59:36,904 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-28 02:59:36,904 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-28 02:59:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:36,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:39,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-28 02:59:39,354 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-28 02:59:39,354 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-28 02:59:39,354 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-28 02:59:39,354 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:39,354 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-28 02:59:39,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {65398#(< main_~i~0 1024)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-28 02:59:39,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {65402#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65398#(< main_~i~0 1024)} is VALID [2022-04-28 02:59:39,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {65402#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65402#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:39,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {65409#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65402#(< main_~i~0 1023)} is VALID [2022-04-28 02:59:39,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {65409#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65409#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:39,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {65416#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65409#(< main_~i~0 1022)} is VALID [2022-04-28 02:59:39,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {65416#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65416#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:39,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {65423#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65416#(< main_~i~0 1021)} is VALID [2022-04-28 02:59:39,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {65423#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65423#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:39,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {65430#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65423#(< main_~i~0 1020)} is VALID [2022-04-28 02:59:39,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {65430#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65430#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:39,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {65437#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65430#(< main_~i~0 1019)} is VALID [2022-04-28 02:59:39,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {65437#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65437#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:39,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {65444#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65437#(< main_~i~0 1018)} is VALID [2022-04-28 02:59:39,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {65444#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65444#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:39,359 INFO L290 TraceCheckUtils]: 83: Hoare triple {65451#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65444#(< main_~i~0 1017)} is VALID [2022-04-28 02:59:39,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {65451#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65451#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:39,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {65458#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65451#(< main_~i~0 1016)} is VALID [2022-04-28 02:59:39,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {65458#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65458#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:39,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {65465#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65458#(< main_~i~0 1015)} is VALID [2022-04-28 02:59:39,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {65465#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65465#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:39,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {65472#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65465#(< main_~i~0 1014)} is VALID [2022-04-28 02:59:39,360 INFO L290 TraceCheckUtils]: 76: Hoare triple {65472#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65472#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:39,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {65479#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65472#(< main_~i~0 1013)} is VALID [2022-04-28 02:59:39,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {65479#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65479#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:39,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {65486#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65479#(< main_~i~0 1012)} is VALID [2022-04-28 02:59:39,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {65486#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65486#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:39,361 INFO L290 TraceCheckUtils]: 71: Hoare triple {65493#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65486#(< main_~i~0 1011)} is VALID [2022-04-28 02:59:39,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {65493#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65493#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:39,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {65500#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65493#(< main_~i~0 1010)} is VALID [2022-04-28 02:59:39,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {65500#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65500#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:39,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {65507#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65500#(< main_~i~0 1009)} is VALID [2022-04-28 02:59:39,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {65507#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65507#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:39,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {65514#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65507#(< main_~i~0 1008)} is VALID [2022-04-28 02:59:39,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {65514#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65514#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:39,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {65521#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65514#(< main_~i~0 1007)} is VALID [2022-04-28 02:59:39,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {65521#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65521#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:39,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {65528#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65521#(< main_~i~0 1006)} is VALID [2022-04-28 02:59:39,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {65528#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65528#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:39,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {65535#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65528#(< main_~i~0 1005)} is VALID [2022-04-28 02:59:39,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {65535#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65535#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:39,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {65542#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65535#(< main_~i~0 1004)} is VALID [2022-04-28 02:59:39,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {65542#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65542#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:39,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {65549#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65542#(< main_~i~0 1003)} is VALID [2022-04-28 02:59:39,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {65549#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65549#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:39,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {65556#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65549#(< main_~i~0 1002)} is VALID [2022-04-28 02:59:39,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {65556#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65556#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:39,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {65563#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65556#(< main_~i~0 1001)} is VALID [2022-04-28 02:59:39,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {65563#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65563#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:39,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {65570#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65563#(< main_~i~0 1000)} is VALID [2022-04-28 02:59:39,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {65570#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65570#(< main_~i~0 999)} is VALID [2022-04-28 02:59:39,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {65577#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65570#(< main_~i~0 999)} is VALID [2022-04-28 02:59:39,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {65577#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65577#(< main_~i~0 998)} is VALID [2022-04-28 02:59:39,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {65584#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65577#(< main_~i~0 998)} is VALID [2022-04-28 02:59:39,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {65584#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65584#(< main_~i~0 997)} is VALID [2022-04-28 02:59:39,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {65591#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65584#(< main_~i~0 997)} is VALID [2022-04-28 02:59:39,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {65591#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65591#(< main_~i~0 996)} is VALID [2022-04-28 02:59:39,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {65598#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65591#(< main_~i~0 996)} is VALID [2022-04-28 02:59:39,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {65598#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65598#(< main_~i~0 995)} is VALID [2022-04-28 02:59:39,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {65605#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65598#(< main_~i~0 995)} is VALID [2022-04-28 02:59:39,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {65605#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65605#(< main_~i~0 994)} is VALID [2022-04-28 02:59:39,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {65612#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65605#(< main_~i~0 994)} is VALID [2022-04-28 02:59:39,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {65612#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65612#(< main_~i~0 993)} is VALID [2022-04-28 02:59:39,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {65619#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65612#(< main_~i~0 993)} is VALID [2022-04-28 02:59:39,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {65619#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65619#(< main_~i~0 992)} is VALID [2022-04-28 02:59:39,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {65626#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65619#(< main_~i~0 992)} is VALID [2022-04-28 02:59:39,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {65626#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65626#(< main_~i~0 991)} is VALID [2022-04-28 02:59:39,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {65633#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65626#(< main_~i~0 991)} is VALID [2022-04-28 02:59:39,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {65633#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65633#(< main_~i~0 990)} is VALID [2022-04-28 02:59:39,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {65640#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65633#(< main_~i~0 990)} is VALID [2022-04-28 02:59:39,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {65640#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65640#(< main_~i~0 989)} is VALID [2022-04-28 02:59:39,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {65647#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65640#(< main_~i~0 989)} is VALID [2022-04-28 02:59:39,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {65647#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65647#(< main_~i~0 988)} is VALID [2022-04-28 02:59:39,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {65654#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65647#(< main_~i~0 988)} is VALID [2022-04-28 02:59:39,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {65654#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65654#(< main_~i~0 987)} is VALID [2022-04-28 02:59:39,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {65661#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65654#(< main_~i~0 987)} is VALID [2022-04-28 02:59:39,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {65661#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65661#(< main_~i~0 986)} is VALID [2022-04-28 02:59:39,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {65668#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65661#(< main_~i~0 986)} is VALID [2022-04-28 02:59:39,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {65668#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65668#(< main_~i~0 985)} is VALID [2022-04-28 02:59:39,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {65675#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65668#(< main_~i~0 985)} is VALID [2022-04-28 02:59:39,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {65675#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65675#(< main_~i~0 984)} is VALID [2022-04-28 02:59:39,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {65682#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65675#(< main_~i~0 984)} is VALID [2022-04-28 02:59:39,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {65682#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65682#(< main_~i~0 983)} is VALID [2022-04-28 02:59:39,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {65689#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65682#(< main_~i~0 983)} is VALID [2022-04-28 02:59:39,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {65689#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65689#(< main_~i~0 982)} is VALID [2022-04-28 02:59:39,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {65696#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65689#(< main_~i~0 982)} is VALID [2022-04-28 02:59:39,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {65696#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65696#(< main_~i~0 981)} is VALID [2022-04-28 02:59:39,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {65703#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65696#(< main_~i~0 981)} is VALID [2022-04-28 02:59:39,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {65703#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65703#(< main_~i~0 980)} is VALID [2022-04-28 02:59:39,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {65710#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65703#(< main_~i~0 980)} is VALID [2022-04-28 02:59:39,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {65710#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65710#(< main_~i~0 979)} is VALID [2022-04-28 02:59:39,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {65717#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65710#(< main_~i~0 979)} is VALID [2022-04-28 02:59:39,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {65717#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65717#(< main_~i~0 978)} is VALID [2022-04-28 02:59:39,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65717#(< main_~i~0 978)} is VALID [2022-04-28 02:59:39,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-28 02:59:39,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-28 02:59:39,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-28 02:59:39,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#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(12, 2); {64951#true} is VALID [2022-04-28 02:59:39,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-28 02:59:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622986295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:39,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:39,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 02:59:39,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952450250] [2022-04-28 02:59:39,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952450250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:39,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:39,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 02:59:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443182335] [2022-04-28 02:59:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:39,378 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 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 115 [2022-04-28 02:59:39,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:39,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:39,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:39,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 02:59:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 02:59:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 02:59:39,422 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:46,368 INFO L93 Difference]: Finished difference Result 362 states and 460 transitions. [2022-04-28 02:59:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 02:59:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 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 115 [2022-04-28 02:59:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-28 02:59:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-28 02:59:46,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 451 transitions. [2022-04-28 02:59:46,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:46,601 INFO L225 Difference]: With dead ends: 362 [2022-04-28 02:59:46,601 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 02:59:46,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 02:59:46,602 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1313 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:46,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 32 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:59:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 02:59:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 118. [2022-04-28 02:59:47,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:47,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:47,081 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:47,081 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:47,085 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-28 02:59:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-28 02:59:47,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:47,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:47,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 02:59:47,085 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-28 02:59:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:47,089 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-28 02:59:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-28 02:59:47,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:47,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:47,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:47,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-04-28 02:59:47,091 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 115 [2022-04-28 02:59:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:47,091 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-04-28 02:59:47,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:47,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 122 transitions. [2022-04-28 02:59:47,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-04-28 02:59:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 02:59:47,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:47,326 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:47,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-28 02:59:47,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 02:59:47,527 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 95 times [2022-04-28 02:59:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:47,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180816621] [2022-04-28 02:59:47,530 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:47,530 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:47,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 96 times [2022-04-28 02:59:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:47,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450659517] [2022-04-28 02:59:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:48,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {67538#(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(12, 2); {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:48,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {67538#(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(12, 2); {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-28 02:59:48,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-28 02:59:48,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67490#(= main_~i~0 0)} is VALID [2022-04-28 02:59:48,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {67490#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67490#(= main_~i~0 0)} is VALID [2022-04-28 02:59:48,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {67490#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {67491#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {67491#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {67492#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {67492#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67493#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:48,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {67493#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67493#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:48,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {67493#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67494#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:48,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {67494#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67494#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:48,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {67494#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67495#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:48,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {67495#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67495#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:48,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {67495#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67496#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:48,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {67496#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67496#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:48,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {67496#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67497#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:48,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {67497#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67497#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:48,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {67497#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67498#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:48,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {67498#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67498#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:48,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {67498#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67499#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:48,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {67499#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67499#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:48,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {67499#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67500#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:48,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {67500#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67500#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:48,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {67500#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67501#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:48,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {67501#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67501#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:48,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {67501#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67502#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:48,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {67502#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67502#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:48,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {67502#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67503#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:48,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {67503#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67503#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:48,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {67503#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67504#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:48,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {67504#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67504#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:48,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {67504#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67505#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:48,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {67505#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67505#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:48,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {67505#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67506#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:48,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {67506#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67506#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:48,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {67506#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67507#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:48,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {67507#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67507#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:48,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {67507#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67508#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:48,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {67508#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67508#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:48,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {67508#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67509#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:48,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {67509#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67509#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:48,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {67509#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67510#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:48,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {67510#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67510#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:48,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {67510#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67511#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:48,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {67511#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67511#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:48,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {67511#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67512#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:48,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {67512#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67512#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:48,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {67512#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67513#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:48,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {67513#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67513#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:48,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {67513#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67514#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:48,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {67514#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67514#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:48,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {67514#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67515#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:48,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {67515#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67515#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:48,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {67515#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67516#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:48,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {67516#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67516#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:48,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {67516#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67517#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:48,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {67517#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67517#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:48,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {67517#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67518#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:48,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {67518#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67518#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:48,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {67518#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67519#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:48,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {67519#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67519#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:48,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {67519#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67520#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:48,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {67520#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67520#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:48,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {67520#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67521#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:48,356 INFO L290 TraceCheckUtils]: 68: Hoare triple {67521#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67521#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:48,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {67521#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67522#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:48,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {67522#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67522#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:48,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {67522#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67523#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:48,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {67523#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67523#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:48,357 INFO L290 TraceCheckUtils]: 73: Hoare triple {67523#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67524#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:48,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {67524#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67524#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:48,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {67524#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67525#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:48,358 INFO L290 TraceCheckUtils]: 76: Hoare triple {67525#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67525#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:48,358 INFO L290 TraceCheckUtils]: 77: Hoare triple {67525#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67526#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:48,358 INFO L290 TraceCheckUtils]: 78: Hoare triple {67526#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67526#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:48,359 INFO L290 TraceCheckUtils]: 79: Hoare triple {67526#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67527#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:48,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {67527#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67527#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:48,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {67527#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67528#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:48,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {67528#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67528#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:48,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {67528#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67529#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:48,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {67529#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67529#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:48,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {67529#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67530#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:48,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {67530#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67530#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:48,361 INFO L290 TraceCheckUtils]: 87: Hoare triple {67530#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67531#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:48,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {67531#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67531#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:48,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {67531#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67532#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:48,361 INFO L290 TraceCheckUtils]: 90: Hoare triple {67532#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67532#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:48,361 INFO L290 TraceCheckUtils]: 91: Hoare triple {67532#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67533#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:48,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {67533#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67533#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:48,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {67533#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67534#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:48,362 INFO L290 TraceCheckUtils]: 94: Hoare triple {67534#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67534#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:48,362 INFO L290 TraceCheckUtils]: 95: Hoare triple {67534#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67535#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:48,362 INFO L290 TraceCheckUtils]: 96: Hoare triple {67535#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67535#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:48,363 INFO L290 TraceCheckUtils]: 97: Hoare triple {67535#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67536#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:48,363 INFO L290 TraceCheckUtils]: 98: Hoare triple {67536#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67536#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:48,363 INFO L290 TraceCheckUtils]: 99: Hoare triple {67536#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67537#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:48,363 INFO L290 TraceCheckUtils]: 100: Hoare triple {67537#(<= main_~i~0 47)} assume !(~i~0 < 1024); {67486#false} is VALID [2022-04-28 02:59:48,363 INFO L290 TraceCheckUtils]: 101: Hoare triple {67486#false} ~i~0 := 0; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 102: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 103: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 104: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 105: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 107: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 109: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 110: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 111: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 112: Hoare triple {67486#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L272 TraceCheckUtils]: 113: Hoare triple {67486#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 114: Hoare triple {67486#false} ~cond := #in~cond; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 115: Hoare triple {67486#false} assume 0 == ~cond; {67486#false} is VALID [2022-04-28 02:59:48,364 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-28 02:59:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450659517] [2022-04-28 02:59:48,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450659517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427469307] [2022-04-28 02:59:48,365 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:59:48,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:48,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:48,368 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:48,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 02:59:48,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:59:48,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:48,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:59:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:59:48,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#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(12, 2); {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,915 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,916 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-28 02:59:48,917 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67845#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:48,918 INFO L290 TraceCheckUtils]: 102: Hoare triple {67845#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {67845#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:48,918 INFO L290 TraceCheckUtils]: 103: Hoare triple {67845#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67845#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:48,918 INFO L290 TraceCheckUtils]: 104: Hoare triple {67845#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67845#(<= main_~i~0 0)} is VALID [2022-04-28 02:59:48,919 INFO L290 TraceCheckUtils]: 105: Hoare triple {67845#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,919 INFO L290 TraceCheckUtils]: 106: Hoare triple {67491#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,919 INFO L290 TraceCheckUtils]: 107: Hoare triple {67491#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,920 INFO L290 TraceCheckUtils]: 108: Hoare triple {67491#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67491#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:48,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {67491#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {67492#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,921 INFO L290 TraceCheckUtils]: 111: Hoare triple {67492#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,921 INFO L290 TraceCheckUtils]: 112: Hoare triple {67492#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67492#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:48,921 INFO L272 TraceCheckUtils]: 113: Hoare triple {67492#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:48,922 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:48,922 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-28 02:59:48,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-28 02:59:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-28 02:59:48,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:59:49,157 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-28 02:59:49,157 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-28 02:59:49,157 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:49,158 INFO L272 TraceCheckUtils]: 113: Hoare triple {67902#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:49,158 INFO L290 TraceCheckUtils]: 112: Hoare triple {67902#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67902#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:49,158 INFO L290 TraceCheckUtils]: 111: Hoare triple {67902#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67902#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:49,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {67902#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {67902#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:49,159 INFO L290 TraceCheckUtils]: 109: Hoare triple {67915#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67902#(<= main_~i~0 512)} is VALID [2022-04-28 02:59:49,159 INFO L290 TraceCheckUtils]: 108: Hoare triple {67915#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67915#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:49,159 INFO L290 TraceCheckUtils]: 107: Hoare triple {67915#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67915#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:49,159 INFO L290 TraceCheckUtils]: 106: Hoare triple {67915#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {67915#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 105: Hoare triple {67928#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67915#(<= main_~i~0 511)} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 104: Hoare triple {67928#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67928#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 103: Hoare triple {67928#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67928#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:49,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {67928#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {67928#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67928#(<= main_~i~0 510)} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#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(12, 2); {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-28 02:59:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-28 02:59:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427469307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:49,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 7, 7] total 57 [2022-04-28 02:59:49,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:49,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180816621] [2022-04-28 02:59:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180816621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 02:59:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824923881] [2022-04-28 02:59:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 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 117 [2022-04-28 02:59:49,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:49,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:49,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:49,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 02:59:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:49,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 02:59:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=1755, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 02:59:49,242 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:57,066 INFO L93 Difference]: Finished difference Result 369 states and 469 transitions. [2022-04-28 02:59:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 02:59:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 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 117 [2022-04-28 02:59:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-28 02:59:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-28 02:59:57,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 460 transitions. [2022-04-28 02:59:57,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:59:57,406 INFO L225 Difference]: With dead ends: 369 [2022-04-28 02:59:57,406 INFO L226 Difference]: Without dead ends: 352 [2022-04-28 02:59:57,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4030, Invalid=6890, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 02:59:57,407 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1038 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:57,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 42 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:59:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-28 02:59:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 120. [2022-04-28 02:59:58,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:58,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:58,015 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:58,015 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:58,019 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-28 02:59:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-28 02:59:58,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:58,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:58,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-28 02:59:58,020 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-28 02:59:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:58,024 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-28 02:59:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-28 02:59:58,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:58,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:58,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:58,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-04-28 02:59:58,025 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 117 [2022-04-28 02:59:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:58,025 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-04-28 02:59:58,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:59:58,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 124 transitions. [2022-04-28 02:59:58,287 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-28 02:59:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-28 02:59:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 02:59:58,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:58,287 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:58,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 02:59:58,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:58,504 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 97 times [2022-04-28 02:59:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49185360] [2022-04-28 02:59:58,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:59:58,512 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:59:58,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:59:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 98 times [2022-04-28 02:59:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:58,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543708306] [2022-04-28 02:59:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:59,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:59,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {70078#(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(12, 2); {70024#true} is VALID [2022-04-28 02:59:59,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:59,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {70078#(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(12, 2); {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-28 02:59:59,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70029#(= main_~i~0 0)} is VALID [2022-04-28 02:59:59,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {70029#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70029#(= main_~i~0 0)} is VALID [2022-04-28 02:59:59,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {70029#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:59,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-28 02:59:59,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:59,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-28 02:59:59,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:59,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-28 02:59:59,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:59,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-28 02:59:59,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:59,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-28 02:59:59,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:59,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-28 02:59:59,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:59,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-28 02:59:59,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:59,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-28 02:59:59,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:59,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-28 02:59:59,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:59,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-28 02:59:59,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:59,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-28 02:59:59,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:59,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-28 02:59:59,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:59,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-28 02:59:59,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:59,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-28 02:59:59,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:59,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-28 02:59:59,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:59,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-28 02:59:59,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:59,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-28 02:59:59,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:59,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-28 02:59:59,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:59,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-28 02:59:59,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:59,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-28 02:59:59,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:59,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-28 02:59:59,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:59,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-28 02:59:59,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:59,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-28 02:59:59,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:59,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-28 02:59:59,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:59,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-28 02:59:59,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:59,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-28 02:59:59,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:59,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-28 02:59:59,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:59,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-28 02:59:59,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:59,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-28 02:59:59,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:59,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-28 02:59:59,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:59,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-28 02:59:59,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:59,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-28 02:59:59,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:59,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-28 02:59:59,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:59,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-28 02:59:59,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:59,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-28 02:59:59,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:59,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-28 02:59:59,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:59,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-28 02:59:59,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:59,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-28 02:59:59,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:59,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-28 02:59:59,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:59,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-28 02:59:59,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:59,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-28 02:59:59,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:59,370 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-28 02:59:59,370 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:59,370 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-28 02:59:59,371 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:59,371 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-28 02:59:59,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:59,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-28 02:59:59,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:59,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-28 02:59:59,372 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:59,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-28 02:59:59,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-28 02:59:59,373 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-28 02:59:59,374 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-28 02:59:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 02:59:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:59,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543708306] [2022-04-28 02:59:59,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543708306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:59,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148059814] [2022-04-28 02:59:59,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:59:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:59,377 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:59:59,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 02:59:59,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:59:59,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:59:59,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 02:59:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:59,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:00,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-28 03:00:00,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#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(12, 2); {70024#true} is VALID [2022-04-28 03:00:00,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-28 03:00:00,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-28 03:00:00,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-28 03:00:00,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70097#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:00,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {70097#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70097#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:00,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {70097#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:00,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:00,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:00,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:00,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:00,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:00,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:00,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:00,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:00,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:00,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:00,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:00,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:00,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:00,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:00,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:00,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:00,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:00,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:00,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:00,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:00,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:00,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:00,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:00,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:00,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:00,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:00,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:00,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:00,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:00,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:00,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:00,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:00,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:00,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:00,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:00,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:00,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:00,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:00,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:00,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:00,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:00,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:00,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:00,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:00,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:00,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:00,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:00,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:00,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:00,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:00,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:00,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:00,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:00,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:00,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:00,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:00,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:00,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:00,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:00,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:00,085 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:00,085 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:00,085 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:00,085 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:00,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:00,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:00,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:00,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:00,086 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:00,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:00,087 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:00,087 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:00,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:00,087 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:00,088 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:00,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:00,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:00,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:00,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:00,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:00,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:00,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:00,089 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:00,090 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:00,090 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:00,090 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:00,090 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:00,091 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:00,091 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:00,091 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:00,091 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:00,092 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-28 03:00:00,093 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-28 03:00:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:00,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:02,054 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:02,055 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {70485#(< main_~i~0 1024)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {70489#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70485#(< main_~i~0 1024)} is VALID [2022-04-28 03:00:02,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {70489#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70489#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:02,057 INFO L290 TraceCheckUtils]: 99: Hoare triple {70496#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70489#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:02,057 INFO L290 TraceCheckUtils]: 98: Hoare triple {70496#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70496#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:02,057 INFO L290 TraceCheckUtils]: 97: Hoare triple {70503#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70496#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:02,057 INFO L290 TraceCheckUtils]: 96: Hoare triple {70503#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70503#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:02,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {70510#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70503#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:02,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {70510#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70510#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:02,058 INFO L290 TraceCheckUtils]: 93: Hoare triple {70517#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70510#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:02,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {70517#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70517#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:02,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {70524#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70517#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:02,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {70524#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70524#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:02,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {70531#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70524#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:02,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {70531#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70531#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:02,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {70538#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70531#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:02,060 INFO L290 TraceCheckUtils]: 86: Hoare triple {70538#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70538#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:02,060 INFO L290 TraceCheckUtils]: 85: Hoare triple {70545#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70538#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:02,060 INFO L290 TraceCheckUtils]: 84: Hoare triple {70545#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70545#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:02,060 INFO L290 TraceCheckUtils]: 83: Hoare triple {70552#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70545#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:02,061 INFO L290 TraceCheckUtils]: 82: Hoare triple {70552#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70552#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:02,061 INFO L290 TraceCheckUtils]: 81: Hoare triple {70559#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70552#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:02,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {70559#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70559#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:02,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {70566#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70559#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:02,061 INFO L290 TraceCheckUtils]: 78: Hoare triple {70566#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70566#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:02,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {70573#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70566#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:02,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {70573#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70573#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:02,062 INFO L290 TraceCheckUtils]: 75: Hoare triple {70580#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70573#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:02,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {70580#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70580#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:02,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {70587#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70580#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:02,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {70587#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70587#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:02,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {70594#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70587#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:02,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {70594#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70594#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:02,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {70601#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70594#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:02,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {70601#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70601#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:02,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {70608#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70601#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:02,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {70608#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70608#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:02,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {70615#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70608#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:02,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {70615#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70615#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:02,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {70622#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70615#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:02,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {70622#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70622#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:02,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {70629#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70622#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:02,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {70629#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70629#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:02,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {70636#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70629#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:02,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {70636#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70636#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:02,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {70643#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70636#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:02,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {70643#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70643#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:02,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {70650#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70643#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:02,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {70650#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70650#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:02,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {70657#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70650#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:02,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {70657#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70657#(< main_~i~0 999)} is VALID [2022-04-28 03:00:02,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {70664#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70657#(< main_~i~0 999)} is VALID [2022-04-28 03:00:02,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {70664#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70664#(< main_~i~0 998)} is VALID [2022-04-28 03:00:02,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {70671#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70664#(< main_~i~0 998)} is VALID [2022-04-28 03:00:02,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {70671#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70671#(< main_~i~0 997)} is VALID [2022-04-28 03:00:02,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {70678#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70671#(< main_~i~0 997)} is VALID [2022-04-28 03:00:02,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {70678#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70678#(< main_~i~0 996)} is VALID [2022-04-28 03:00:02,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {70685#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70678#(< main_~i~0 996)} is VALID [2022-04-28 03:00:02,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {70685#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70685#(< main_~i~0 995)} is VALID [2022-04-28 03:00:02,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {70692#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70685#(< main_~i~0 995)} is VALID [2022-04-28 03:00:02,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {70692#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70692#(< main_~i~0 994)} is VALID [2022-04-28 03:00:02,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {70699#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70692#(< main_~i~0 994)} is VALID [2022-04-28 03:00:02,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {70699#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70699#(< main_~i~0 993)} is VALID [2022-04-28 03:00:02,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {70706#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70699#(< main_~i~0 993)} is VALID [2022-04-28 03:00:02,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {70706#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70706#(< main_~i~0 992)} is VALID [2022-04-28 03:00:02,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {70713#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70706#(< main_~i~0 992)} is VALID [2022-04-28 03:00:02,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {70713#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70713#(< main_~i~0 991)} is VALID [2022-04-28 03:00:02,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {70720#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70713#(< main_~i~0 991)} is VALID [2022-04-28 03:00:02,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {70720#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70720#(< main_~i~0 990)} is VALID [2022-04-28 03:00:02,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {70727#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70720#(< main_~i~0 990)} is VALID [2022-04-28 03:00:02,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {70727#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70727#(< main_~i~0 989)} is VALID [2022-04-28 03:00:02,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {70734#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70727#(< main_~i~0 989)} is VALID [2022-04-28 03:00:02,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {70734#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70734#(< main_~i~0 988)} is VALID [2022-04-28 03:00:02,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {70741#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70734#(< main_~i~0 988)} is VALID [2022-04-28 03:00:02,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {70741#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70741#(< main_~i~0 987)} is VALID [2022-04-28 03:00:02,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {70748#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70741#(< main_~i~0 987)} is VALID [2022-04-28 03:00:02,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {70748#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70748#(< main_~i~0 986)} is VALID [2022-04-28 03:00:02,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {70755#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70748#(< main_~i~0 986)} is VALID [2022-04-28 03:00:02,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {70755#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70755#(< main_~i~0 985)} is VALID [2022-04-28 03:00:02,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {70762#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70755#(< main_~i~0 985)} is VALID [2022-04-28 03:00:02,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {70762#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70762#(< main_~i~0 984)} is VALID [2022-04-28 03:00:02,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {70769#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70762#(< main_~i~0 984)} is VALID [2022-04-28 03:00:02,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {70769#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70769#(< main_~i~0 983)} is VALID [2022-04-28 03:00:02,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {70776#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70769#(< main_~i~0 983)} is VALID [2022-04-28 03:00:02,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {70776#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70776#(< main_~i~0 982)} is VALID [2022-04-28 03:00:02,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {70783#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70776#(< main_~i~0 982)} is VALID [2022-04-28 03:00:02,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {70783#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70783#(< main_~i~0 981)} is VALID [2022-04-28 03:00:02,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {70790#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70783#(< main_~i~0 981)} is VALID [2022-04-28 03:00:02,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {70790#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70790#(< main_~i~0 980)} is VALID [2022-04-28 03:00:02,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {70797#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70790#(< main_~i~0 980)} is VALID [2022-04-28 03:00:02,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {70797#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70797#(< main_~i~0 979)} is VALID [2022-04-28 03:00:02,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {70804#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70797#(< main_~i~0 979)} is VALID [2022-04-28 03:00:02,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {70804#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70804#(< main_~i~0 978)} is VALID [2022-04-28 03:00:02,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {70811#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70804#(< main_~i~0 978)} is VALID [2022-04-28 03:00:02,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {70811#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70811#(< main_~i~0 977)} is VALID [2022-04-28 03:00:02,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {70818#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70811#(< main_~i~0 977)} is VALID [2022-04-28 03:00:02,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {70818#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70818#(< main_~i~0 976)} is VALID [2022-04-28 03:00:02,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70818#(< main_~i~0 976)} is VALID [2022-04-28 03:00:02,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-28 03:00:02,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-28 03:00:02,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-28 03:00:02,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#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(12, 2); {70024#true} is VALID [2022-04-28 03:00:02,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-28 03:00:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:02,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148059814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:02,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:02,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-28 03:00:02,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:02,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49185360] [2022-04-28 03:00:02,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49185360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:02,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:02,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:00:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472595415] [2022-04-28 03:00:02,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 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 119 [2022-04-28 03:00:02,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:02,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:02,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:02,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:00:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:02,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:00:02,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:00:02,125 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:10,254 INFO L93 Difference]: Finished difference Result 376 states and 478 transitions. [2022-04-28 03:00:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:00:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 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 119 [2022-04-28 03:00:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-28 03:00:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-28 03:00:10,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 469 transitions. [2022-04-28 03:00:10,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:10,590 INFO L225 Difference]: With dead ends: 376 [2022-04-28 03:00:10,590 INFO L226 Difference]: Without dead ends: 359 [2022-04-28 03:00:10,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-28 03:00:10,592 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1167 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:10,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 37 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:00:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-28 03:00:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 122. [2022-04-28 03:00:11,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:11,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:11,216 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:11,216 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:11,220 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-28 03:00:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-28 03:00:11,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:11,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:11,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 03:00:11,221 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 359 states. [2022-04-28 03:00:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:11,225 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-28 03:00:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-28 03:00:11,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:11,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:11,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:11,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-04-28 03:00:11,227 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 119 [2022-04-28 03:00:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:11,227 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-04-28 03:00:11,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:11,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 126 transitions. [2022-04-28 03:00:11,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-04-28 03:00:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 03:00:11,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:11,472 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:11,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:11,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 03:00:11,676 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:11,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 99 times [2022-04-28 03:00:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233686292] [2022-04-28 03:00:11,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:11,686 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:11,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 100 times [2022-04-28 03:00:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828188692] [2022-04-28 03:00:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:12,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {72709#(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(12, 2); {72654#true} is VALID [2022-04-28 03:00:12,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:12,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {72709#(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(12, 2); {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-28 03:00:12,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72659#(= main_~i~0 0)} is VALID [2022-04-28 03:00:12,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {72659#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72659#(= main_~i~0 0)} is VALID [2022-04-28 03:00:12,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {72659#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:12,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:12,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:12,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:12,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:12,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:12,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:12,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:12,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:12,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:12,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:12,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:12,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:12,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:12,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:12,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:12,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:12,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:12,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:12,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:12,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:12,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:12,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:12,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:12,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:12,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:12,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:12,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:12,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:12,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:12,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:12,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:12,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:12,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:12,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:12,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:12,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:12,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:12,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:12,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:12,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:12,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:12,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:12,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:12,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:12,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:12,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:12,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:12,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:12,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:12,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:12,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:12,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:12,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:12,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:12,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:12,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:12,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:12,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:12,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:12,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:12,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:12,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:12,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:12,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:12,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:12,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:12,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:12,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:12,621 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:12,621 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:12,621 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:12,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:12,622 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:12,622 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:12,622 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:12,622 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:12,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:12,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:12,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:12,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:12,623 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:12,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:12,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:12,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:12,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:12,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:12,625 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:12,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:12,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:12,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:12,626 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:12,626 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:12,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:12,626 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:12,626 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:12,627 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-28 03:00:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828188692] [2022-04-28 03:00:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828188692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542439230] [2022-04-28 03:00:12,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:12,630 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:12,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 03:00:12,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:12,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:12,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 03:00:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:13,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-28 03:00:13,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#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(12, 2); {72654#true} is VALID [2022-04-28 03:00:13,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-28 03:00:13,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-28 03:00:13,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-28 03:00:13,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72728#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:13,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {72728#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72728#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:13,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {72728#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:13,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:13,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:13,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:13,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:13,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:13,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:13,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:13,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:13,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:13,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:13,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:13,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:13,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:13,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:13,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:13,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:13,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:13,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:13,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:13,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:13,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:13,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:13,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:13,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:13,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:13,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:13,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:13,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:13,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:13,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:13,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:13,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:13,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:13,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:13,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:13,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:13,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:13,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:13,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:13,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:13,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:13,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:13,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:13,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:13,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:13,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:13,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:13,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:13,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:13,441 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:13,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:13,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:13,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:13,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:13,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:13,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:13,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:13,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:13,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:13,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:13,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:13,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:13,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:13,445 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:13,446 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:13,446 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:13,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:13,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:13,447 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:13,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:13,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:13,448 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:13,448 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:13,448 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:13,448 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:13,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:13,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:13,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:13,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:13,450 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:13,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:13,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:13,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:13,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:13,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:13,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:13,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:13,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:13,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:13,452 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:13,452 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:13,453 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:13,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:13,453 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:13,453 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:13,453 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:13,454 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-28 03:00:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:13,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:15,558 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-28 03:00:15,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-28 03:00:15,560 INFO L290 TraceCheckUtils]: 104: Hoare triple {73122#(< main_~i~0 1024)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-28 03:00:15,560 INFO L290 TraceCheckUtils]: 103: Hoare triple {73126#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73122#(< main_~i~0 1024)} is VALID [2022-04-28 03:00:15,560 INFO L290 TraceCheckUtils]: 102: Hoare triple {73126#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73126#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:15,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {73133#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73126#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:15,561 INFO L290 TraceCheckUtils]: 100: Hoare triple {73133#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73133#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:15,561 INFO L290 TraceCheckUtils]: 99: Hoare triple {73140#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73133#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:15,561 INFO L290 TraceCheckUtils]: 98: Hoare triple {73140#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73140#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:15,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {73147#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73140#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:15,562 INFO L290 TraceCheckUtils]: 96: Hoare triple {73147#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73147#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:15,562 INFO L290 TraceCheckUtils]: 95: Hoare triple {73154#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73147#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:15,562 INFO L290 TraceCheckUtils]: 94: Hoare triple {73154#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73154#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:15,562 INFO L290 TraceCheckUtils]: 93: Hoare triple {73161#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73154#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:15,562 INFO L290 TraceCheckUtils]: 92: Hoare triple {73161#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73161#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:15,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {73168#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73161#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:15,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {73168#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73168#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:15,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {73175#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73168#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:15,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {73175#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73175#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:15,564 INFO L290 TraceCheckUtils]: 87: Hoare triple {73182#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73175#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:15,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {73182#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73182#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:15,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {73189#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73182#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:15,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {73189#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73189#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:15,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {73196#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73189#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:15,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {73196#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73196#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:15,565 INFO L290 TraceCheckUtils]: 81: Hoare triple {73203#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73196#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:15,565 INFO L290 TraceCheckUtils]: 80: Hoare triple {73203#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73203#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:15,565 INFO L290 TraceCheckUtils]: 79: Hoare triple {73210#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73203#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:15,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {73210#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73210#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:15,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {73217#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73210#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:15,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {73217#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73217#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:15,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {73224#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73217#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:15,567 INFO L290 TraceCheckUtils]: 74: Hoare triple {73224#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73224#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:15,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {73231#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73224#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:15,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {73231#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73231#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:15,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {73238#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73231#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:15,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {73238#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73238#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:15,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {73245#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73238#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:15,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {73245#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73245#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:15,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {73252#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73245#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:15,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {73252#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73252#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:15,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {73259#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73252#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:15,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {73259#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73259#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:15,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {73266#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73259#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:15,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {73266#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73266#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:15,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {73273#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73266#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:15,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {73273#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73273#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:15,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {73280#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73273#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:15,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {73280#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73280#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:15,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {73287#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73280#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:15,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {73287#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73287#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:15,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {73294#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73287#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:15,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {73294#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73294#(< main_~i~0 999)} is VALID [2022-04-28 03:00:15,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {73301#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73294#(< main_~i~0 999)} is VALID [2022-04-28 03:00:15,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {73301#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73301#(< main_~i~0 998)} is VALID [2022-04-28 03:00:15,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {73308#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73301#(< main_~i~0 998)} is VALID [2022-04-28 03:00:15,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {73308#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73308#(< main_~i~0 997)} is VALID [2022-04-28 03:00:15,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {73315#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73308#(< main_~i~0 997)} is VALID [2022-04-28 03:00:15,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {73315#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73315#(< main_~i~0 996)} is VALID [2022-04-28 03:00:15,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {73322#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73315#(< main_~i~0 996)} is VALID [2022-04-28 03:00:15,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {73322#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73322#(< main_~i~0 995)} is VALID [2022-04-28 03:00:15,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {73329#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73322#(< main_~i~0 995)} is VALID [2022-04-28 03:00:15,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {73329#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73329#(< main_~i~0 994)} is VALID [2022-04-28 03:00:15,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {73336#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73329#(< main_~i~0 994)} is VALID [2022-04-28 03:00:15,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {73336#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73336#(< main_~i~0 993)} is VALID [2022-04-28 03:00:15,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {73343#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73336#(< main_~i~0 993)} is VALID [2022-04-28 03:00:15,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {73343#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73343#(< main_~i~0 992)} is VALID [2022-04-28 03:00:15,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {73350#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73343#(< main_~i~0 992)} is VALID [2022-04-28 03:00:15,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {73350#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73350#(< main_~i~0 991)} is VALID [2022-04-28 03:00:15,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {73357#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73350#(< main_~i~0 991)} is VALID [2022-04-28 03:00:15,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {73357#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73357#(< main_~i~0 990)} is VALID [2022-04-28 03:00:15,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {73364#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73357#(< main_~i~0 990)} is VALID [2022-04-28 03:00:15,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {73364#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73364#(< main_~i~0 989)} is VALID [2022-04-28 03:00:15,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {73371#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73364#(< main_~i~0 989)} is VALID [2022-04-28 03:00:15,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {73371#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73371#(< main_~i~0 988)} is VALID [2022-04-28 03:00:15,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {73378#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73371#(< main_~i~0 988)} is VALID [2022-04-28 03:00:15,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {73378#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73378#(< main_~i~0 987)} is VALID [2022-04-28 03:00:15,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {73385#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73378#(< main_~i~0 987)} is VALID [2022-04-28 03:00:15,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {73385#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73385#(< main_~i~0 986)} is VALID [2022-04-28 03:00:15,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {73392#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73385#(< main_~i~0 986)} is VALID [2022-04-28 03:00:15,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {73392#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73392#(< main_~i~0 985)} is VALID [2022-04-28 03:00:15,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {73399#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73392#(< main_~i~0 985)} is VALID [2022-04-28 03:00:15,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {73399#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73399#(< main_~i~0 984)} is VALID [2022-04-28 03:00:15,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {73406#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73399#(< main_~i~0 984)} is VALID [2022-04-28 03:00:15,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {73406#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73406#(< main_~i~0 983)} is VALID [2022-04-28 03:00:15,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {73413#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73406#(< main_~i~0 983)} is VALID [2022-04-28 03:00:15,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {73413#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73413#(< main_~i~0 982)} is VALID [2022-04-28 03:00:15,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {73420#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73413#(< main_~i~0 982)} is VALID [2022-04-28 03:00:15,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {73420#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73420#(< main_~i~0 981)} is VALID [2022-04-28 03:00:15,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {73427#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73420#(< main_~i~0 981)} is VALID [2022-04-28 03:00:15,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {73427#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73427#(< main_~i~0 980)} is VALID [2022-04-28 03:00:15,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {73434#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73427#(< main_~i~0 980)} is VALID [2022-04-28 03:00:15,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {73434#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73434#(< main_~i~0 979)} is VALID [2022-04-28 03:00:15,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {73441#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73434#(< main_~i~0 979)} is VALID [2022-04-28 03:00:15,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {73441#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73441#(< main_~i~0 978)} is VALID [2022-04-28 03:00:15,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {73448#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73441#(< main_~i~0 978)} is VALID [2022-04-28 03:00:15,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {73448#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73448#(< main_~i~0 977)} is VALID [2022-04-28 03:00:15,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {73455#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73448#(< main_~i~0 977)} is VALID [2022-04-28 03:00:15,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {73455#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73455#(< main_~i~0 976)} is VALID [2022-04-28 03:00:15,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {73462#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73455#(< main_~i~0 976)} is VALID [2022-04-28 03:00:15,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {73462#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73462#(< main_~i~0 975)} is VALID [2022-04-28 03:00:15,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73462#(< main_~i~0 975)} is VALID [2022-04-28 03:00:15,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-28 03:00:15,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-28 03:00:15,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-28 03:00:15,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#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(12, 2); {72654#true} is VALID [2022-04-28 03:00:15,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-28 03:00:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:15,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542439230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:15,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:15,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 03:00:15,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:15,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233686292] [2022-04-28 03:00:15,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233686292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:15,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:15,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:00:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250826652] [2022-04-28 03:00:15,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:15,584 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 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 121 [2022-04-28 03:00:15,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:15,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:15,629 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-28 03:00:15,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:00:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:00:15,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:00:15,630 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:24,836 INFO L93 Difference]: Finished difference Result 383 states and 487 transitions. [2022-04-28 03:00:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:00:24,836 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 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 121 [2022-04-28 03:00:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-28 03:00:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-28 03:00:24,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 478 transitions. [2022-04-28 03:00:25,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:25,195 INFO L225 Difference]: With dead ends: 383 [2022-04-28 03:00:25,195 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 03:00:25,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 03:00:25,196 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1295 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:25,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 42 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:00:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 03:00:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 124. [2022-04-28 03:00:25,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:25,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,982 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,982 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:25,986 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-28 03:00:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-28 03:00:25,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:25,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:25,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 366 states. [2022-04-28 03:00:25,987 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 366 states. [2022-04-28 03:00:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:25,991 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-28 03:00:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-28 03:00:25,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:25,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:25,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:25,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-28 03:00:25,993 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 121 [2022-04-28 03:00:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:25,993 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-28 03:00:25,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:25,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-28 03:00:26,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-28 03:00:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 03:00:26,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:26,269 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:26,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:26,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:26,471 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 101 times [2022-04-28 03:00:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:26,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829870150] [2022-04-28 03:00:26,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:26,475 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:26,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 102 times [2022-04-28 03:00:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822338168] [2022-04-28 03:00:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {75388#(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(12, 2); {75332#true} is VALID [2022-04-28 03:00:27,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-28 03:00:27,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-28 03:00:27,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:27,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {75388#(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(12, 2); {75332#true} is VALID [2022-04-28 03:00:27,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-28 03:00:27,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-28 03:00:27,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-28 03:00:27,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75337#(= main_~i~0 0)} is VALID [2022-04-28 03:00:27,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {75337#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75337#(= main_~i~0 0)} is VALID [2022-04-28 03:00:27,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {75337#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:27,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {75338#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:27,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {75338#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:27,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {75339#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:27,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {75339#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75340#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:27,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {75340#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75340#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:27,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {75340#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75341#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:27,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {75341#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75341#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:27,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {75341#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75342#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:27,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {75342#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75342#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:27,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {75342#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75343#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:27,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {75343#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75343#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:27,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {75343#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75344#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:27,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {75344#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75344#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:27,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {75344#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75345#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:27,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {75345#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75345#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:27,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {75345#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75346#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:27,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {75346#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75346#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:27,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {75346#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75347#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:27,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {75347#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75347#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:27,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {75347#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75348#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:27,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {75348#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75348#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:27,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {75348#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75349#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:27,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {75349#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75349#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:27,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {75349#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75350#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:27,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {75350#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75350#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:27,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {75350#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75351#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:27,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {75351#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75351#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:27,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {75351#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75352#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:27,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {75352#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75352#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:27,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {75352#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75353#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:27,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {75353#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75353#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:27,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {75353#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75354#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:27,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {75354#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75354#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:27,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {75354#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75355#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:27,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {75355#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75355#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:27,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {75355#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75356#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:27,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {75356#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75356#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:27,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {75356#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75357#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:27,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {75357#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75357#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:27,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {75357#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75358#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:27,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {75358#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75358#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:27,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {75358#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75359#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:27,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {75359#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75359#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:27,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {75359#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75360#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:27,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {75360#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75360#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:27,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {75360#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75361#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:27,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {75361#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75361#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:27,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {75361#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75362#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:27,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {75362#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75362#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:27,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {75362#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75363#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:27,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {75363#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75363#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:27,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {75363#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75364#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:27,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {75364#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75364#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:27,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {75364#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75365#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:27,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {75365#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75365#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:27,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {75365#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75366#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:27,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {75366#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75366#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:27,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {75366#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75367#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:27,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {75367#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75367#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:27,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {75367#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75368#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:27,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {75368#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75368#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:27,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {75368#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75369#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:27,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {75369#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75369#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:27,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {75369#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75370#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:27,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {75370#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75370#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:27,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {75370#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75371#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:27,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {75371#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75371#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:27,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {75371#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75372#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:27,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {75372#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75372#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:27,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {75372#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75373#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:27,539 INFO L290 TraceCheckUtils]: 78: Hoare triple {75373#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75373#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:27,539 INFO L290 TraceCheckUtils]: 79: Hoare triple {75373#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75374#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:27,539 INFO L290 TraceCheckUtils]: 80: Hoare triple {75374#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75374#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:27,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {75374#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75375#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:27,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {75375#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75375#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:27,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {75375#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75376#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:27,541 INFO L290 TraceCheckUtils]: 84: Hoare triple {75376#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75376#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:27,541 INFO L290 TraceCheckUtils]: 85: Hoare triple {75376#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75377#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:27,541 INFO L290 TraceCheckUtils]: 86: Hoare triple {75377#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75377#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:27,542 INFO L290 TraceCheckUtils]: 87: Hoare triple {75377#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75378#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:27,542 INFO L290 TraceCheckUtils]: 88: Hoare triple {75378#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75378#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:27,542 INFO L290 TraceCheckUtils]: 89: Hoare triple {75378#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75379#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:27,542 INFO L290 TraceCheckUtils]: 90: Hoare triple {75379#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75379#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:27,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {75379#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75380#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:27,543 INFO L290 TraceCheckUtils]: 92: Hoare triple {75380#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75380#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:27,543 INFO L290 TraceCheckUtils]: 93: Hoare triple {75380#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75381#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:27,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {75381#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75381#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:27,544 INFO L290 TraceCheckUtils]: 95: Hoare triple {75381#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75382#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:27,544 INFO L290 TraceCheckUtils]: 96: Hoare triple {75382#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75382#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:27,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {75382#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75383#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:27,545 INFO L290 TraceCheckUtils]: 98: Hoare triple {75383#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75383#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:27,545 INFO L290 TraceCheckUtils]: 99: Hoare triple {75383#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75384#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:27,546 INFO L290 TraceCheckUtils]: 100: Hoare triple {75384#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75384#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:27,546 INFO L290 TraceCheckUtils]: 101: Hoare triple {75384#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75385#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:27,546 INFO L290 TraceCheckUtils]: 102: Hoare triple {75385#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75385#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:27,547 INFO L290 TraceCheckUtils]: 103: Hoare triple {75385#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75386#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:27,547 INFO L290 TraceCheckUtils]: 104: Hoare triple {75386#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75386#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:27,547 INFO L290 TraceCheckUtils]: 105: Hoare triple {75386#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75387#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {75387#(<= main_~i~0 50)} assume !(~i~0 < 1024); {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 107: Hoare triple {75333#false} ~i~0 := 0; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 109: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 110: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 111: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 112: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 113: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 114: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 115: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 116: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-28 03:00:27,548 INFO L290 TraceCheckUtils]: 117: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L290 TraceCheckUtils]: 118: Hoare triple {75333#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L272 TraceCheckUtils]: 119: Hoare triple {75333#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L290 TraceCheckUtils]: 120: Hoare triple {75333#false} ~cond := #in~cond; {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L290 TraceCheckUtils]: 121: Hoare triple {75333#false} assume 0 == ~cond; {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-28 03:00:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:27,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822338168] [2022-04-28 03:00:27,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822338168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925371626] [2022-04-28 03:00:27,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:27,551 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:27,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 03:00:27,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:00:27,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:27,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:00:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:28,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#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(12, 2); {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,175 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-28 03:00:28,176 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75713#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:28,176 INFO L290 TraceCheckUtils]: 108: Hoare triple {75713#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {75713#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:28,176 INFO L290 TraceCheckUtils]: 109: Hoare triple {75713#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75713#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:28,176 INFO L290 TraceCheckUtils]: 110: Hoare triple {75713#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75713#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:28,177 INFO L290 TraceCheckUtils]: 111: Hoare triple {75713#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:28,177 INFO L290 TraceCheckUtils]: 112: Hoare triple {75338#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:28,177 INFO L290 TraceCheckUtils]: 113: Hoare triple {75338#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:28,178 INFO L290 TraceCheckUtils]: 114: Hoare triple {75338#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75338#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:28,178 INFO L290 TraceCheckUtils]: 115: Hoare triple {75338#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:28,178 INFO L290 TraceCheckUtils]: 116: Hoare triple {75339#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:28,178 INFO L290 TraceCheckUtils]: 117: Hoare triple {75339#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:28,179 INFO L290 TraceCheckUtils]: 118: Hoare triple {75339#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75339#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:28,179 INFO L272 TraceCheckUtils]: 119: Hoare triple {75339#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:28,179 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:00:28,179 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-28 03:00:28,180 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-28 03:00:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-28 03:00:28,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:28,411 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-28 03:00:28,412 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-28 03:00:28,412 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:00:28,412 INFO L272 TraceCheckUtils]: 119: Hoare triple {75770#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:28,413 INFO L290 TraceCheckUtils]: 118: Hoare triple {75770#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75770#(<= main_~i~0 512)} is VALID [2022-04-28 03:00:28,413 INFO L290 TraceCheckUtils]: 117: Hoare triple {75770#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75770#(<= main_~i~0 512)} is VALID [2022-04-28 03:00:28,413 INFO L290 TraceCheckUtils]: 116: Hoare triple {75770#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {75770#(<= main_~i~0 512)} is VALID [2022-04-28 03:00:28,413 INFO L290 TraceCheckUtils]: 115: Hoare triple {75783#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75770#(<= main_~i~0 512)} is VALID [2022-04-28 03:00:28,414 INFO L290 TraceCheckUtils]: 114: Hoare triple {75783#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75783#(<= main_~i~0 511)} is VALID [2022-04-28 03:00:28,414 INFO L290 TraceCheckUtils]: 113: Hoare triple {75783#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75783#(<= main_~i~0 511)} is VALID [2022-04-28 03:00:28,414 INFO L290 TraceCheckUtils]: 112: Hoare triple {75783#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {75783#(<= main_~i~0 511)} is VALID [2022-04-28 03:00:28,414 INFO L290 TraceCheckUtils]: 111: Hoare triple {75796#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75783#(<= main_~i~0 511)} is VALID [2022-04-28 03:00:28,414 INFO L290 TraceCheckUtils]: 110: Hoare triple {75796#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75796#(<= main_~i~0 510)} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 109: Hoare triple {75796#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75796#(<= main_~i~0 510)} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 108: Hoare triple {75796#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {75796#(<= main_~i~0 510)} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75796#(<= main_~i~0 510)} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,415 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#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(12, 2); {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-28 03:00:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-28 03:00:28,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925371626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:28,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:28,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 7, 7] total 60 [2022-04-28 03:00:28,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829870150] [2022-04-28 03:00:28,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829870150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:28,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:28,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:00:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045238751] [2022-04-28 03:00:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 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 123 [2022-04-28 03:00:28,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:28,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:28,472 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-28 03:00:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:00:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:00:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=1938, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:00:28,473 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:37,696 INFO L93 Difference]: Finished difference Result 390 states and 496 transitions. [2022-04-28 03:00:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:00:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 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 123 [2022-04-28 03:00:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-28 03:00:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-28 03:00:37,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 487 transitions. [2022-04-28 03:00:38,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:38,057 INFO L225 Difference]: With dead ends: 390 [2022-04-28 03:00:38,057 INFO L226 Difference]: Without dead ends: 373 [2022-04-28 03:00:38,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4510, Invalid=7700, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:00:38,058 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:38,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 37 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:00:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-04-28 03:00:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 126. [2022-04-28 03:00:38,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:38,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:38,858 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:38,858 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,862 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-28 03:00:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-28 03:00:38,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-28 03:00:38,863 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 373 states. [2022-04-28 03:00:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,868 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-28 03:00:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-28 03:00:38,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:38,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2022-04-28 03:00:38,869 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 123 [2022-04-28 03:00:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:38,870 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2022-04-28 03:00:38,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:38,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 130 transitions. [2022-04-28 03:00:39,145 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-28 03:00:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:00:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 03:00:39,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:39,146 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:39,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:39,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 03:00:39,360 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 103 times [2022-04-28 03:00:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:39,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647799106] [2022-04-28 03:00:39,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:39,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:39,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 104 times [2022-04-28 03:00:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183257288] [2022-04-28 03:00:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:40,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {78069#(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(12, 2); {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:40,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {78069#(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(12, 2); {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-28 03:00:40,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-28 03:00:40,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78017#(= main_~i~0 0)} is VALID [2022-04-28 03:00:40,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {78017#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78017#(= main_~i~0 0)} is VALID [2022-04-28 03:00:40,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {78017#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:40,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:40,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:40,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:40,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:40,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:40,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:40,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:40,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:40,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:40,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:40,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:40,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:40,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:40,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:40,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:40,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:40,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:40,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:40,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:40,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:40,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:40,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:40,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:40,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:40,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:40,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:40,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:40,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:40,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:40,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:40,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:40,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:40,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:40,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:40,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:40,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:40,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:40,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:40,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:40,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:40,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:40,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:40,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:40,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:40,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:40,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:40,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:40,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:40,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:40,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:40,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:40,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:40,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:40,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:40,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:40,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:40,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:40,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:40,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:40,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:40,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:40,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:40,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:40,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:40,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:40,243 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:40,243 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:40,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:40,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:40,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:40,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:40,245 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:40,245 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:40,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:40,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:40,246 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:40,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:40,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:40,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:40,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:40,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:40,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:40,247 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:40,248 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:40,248 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:40,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:40,248 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:40,249 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:40,249 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:40,249 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:40,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:40,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:40,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:40,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:40,251 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:40,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:40,251 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:40,251 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:40,252 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-28 03:00:40,253 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-28 03:00:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:40,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183257288] [2022-04-28 03:00:40,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183257288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:40,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281561786] [2022-04-28 03:00:40,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:40,256 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:40,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 03:00:40,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:40,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:40,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 03:00:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:40,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:41,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-28 03:00:41,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#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(12, 2); {78012#true} is VALID [2022-04-28 03:00:41,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-28 03:00:41,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-28 03:00:41,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-28 03:00:41,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78088#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:41,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {78088#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78088#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:41,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {78088#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:41,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:41,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:41,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:41,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:41,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:41,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:41,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:41,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:41,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:41,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:41,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:41,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:41,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:41,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:41,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:41,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:41,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:41,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:41,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:41,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:41,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:41,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:41,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:41,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:41,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:41,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:41,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:41,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:41,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:41,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:41,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:41,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:41,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:41,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:41,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:41,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:41,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:41,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:41,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:41,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:41,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:41,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:41,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:41,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:41,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:41,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:41,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:41,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:41,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:41,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:41,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:41,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:41,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:41,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:41,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:41,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:41,258 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:41,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:41,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:41,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:41,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:41,260 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:41,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:41,260 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:41,260 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:41,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:41,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:41,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:41,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:41,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:41,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:41,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:41,263 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:41,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:41,263 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:41,263 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:41,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:41,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:41,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:41,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:41,265 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:41,265 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:41,265 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:41,265 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:41,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:41,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:41,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:41,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:41,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:41,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:41,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:41,268 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:41,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:41,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:41,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:41,269 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:41,269 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:41,269 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:41,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:41,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-28 03:00:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:41,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:43,487 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 108: Hoare triple {78494#(< main_~i~0 1024)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-28 03:00:43,488 INFO L290 TraceCheckUtils]: 107: Hoare triple {78498#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78494#(< main_~i~0 1024)} is VALID [2022-04-28 03:00:43,489 INFO L290 TraceCheckUtils]: 106: Hoare triple {78498#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78498#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:43,489 INFO L290 TraceCheckUtils]: 105: Hoare triple {78505#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78498#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:43,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {78505#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78505#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:43,489 INFO L290 TraceCheckUtils]: 103: Hoare triple {78512#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78505#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:43,490 INFO L290 TraceCheckUtils]: 102: Hoare triple {78512#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78512#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:43,490 INFO L290 TraceCheckUtils]: 101: Hoare triple {78519#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78512#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:43,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {78519#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78519#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:43,490 INFO L290 TraceCheckUtils]: 99: Hoare triple {78526#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78519#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:43,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {78526#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78526#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:43,491 INFO L290 TraceCheckUtils]: 97: Hoare triple {78533#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78526#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:43,491 INFO L290 TraceCheckUtils]: 96: Hoare triple {78533#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78533#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:43,491 INFO L290 TraceCheckUtils]: 95: Hoare triple {78540#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78533#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:43,491 INFO L290 TraceCheckUtils]: 94: Hoare triple {78540#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78540#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:43,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {78547#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78540#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:43,492 INFO L290 TraceCheckUtils]: 92: Hoare triple {78547#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78547#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:43,492 INFO L290 TraceCheckUtils]: 91: Hoare triple {78554#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78547#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:43,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {78554#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78554#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:43,493 INFO L290 TraceCheckUtils]: 89: Hoare triple {78561#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78554#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:43,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {78561#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78561#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:43,493 INFO L290 TraceCheckUtils]: 87: Hoare triple {78568#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78561#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:43,493 INFO L290 TraceCheckUtils]: 86: Hoare triple {78568#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78568#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:43,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {78575#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78568#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:43,494 INFO L290 TraceCheckUtils]: 84: Hoare triple {78575#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78575#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:43,494 INFO L290 TraceCheckUtils]: 83: Hoare triple {78582#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78575#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:43,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {78582#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78582#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:43,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {78589#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78582#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:43,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {78589#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78589#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:43,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {78596#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78589#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:43,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {78596#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78596#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:43,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {78603#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78596#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:43,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {78603#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78603#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:43,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {78610#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78603#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:43,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {78610#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78610#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:43,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {78617#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78610#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:43,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {78617#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78617#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:43,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {78624#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78617#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:43,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {78624#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78624#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:43,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {78631#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78624#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:43,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {78631#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78631#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:43,498 INFO L290 TraceCheckUtils]: 67: Hoare triple {78638#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78631#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:43,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {78638#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78638#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:43,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {78645#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78638#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:43,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {78645#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78645#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:43,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {78652#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:43,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {78652#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78652#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:43,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {78659#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:43,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {78659#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78659#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:43,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {78666#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:43,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {78666#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78666#(< main_~i~0 999)} is VALID [2022-04-28 03:00:43,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {78673#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(< main_~i~0 999)} is VALID [2022-04-28 03:00:43,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {78673#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78673#(< main_~i~0 998)} is VALID [2022-04-28 03:00:43,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {78680#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(< main_~i~0 998)} is VALID [2022-04-28 03:00:43,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {78680#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78680#(< main_~i~0 997)} is VALID [2022-04-28 03:00:43,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {78687#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(< main_~i~0 997)} is VALID [2022-04-28 03:00:43,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {78687#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78687#(< main_~i~0 996)} is VALID [2022-04-28 03:00:43,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {78694#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(< main_~i~0 996)} is VALID [2022-04-28 03:00:43,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {78694#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78694#(< main_~i~0 995)} is VALID [2022-04-28 03:00:43,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {78701#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(< main_~i~0 995)} is VALID [2022-04-28 03:00:43,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {78701#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78701#(< main_~i~0 994)} is VALID [2022-04-28 03:00:43,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {78708#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78701#(< main_~i~0 994)} is VALID [2022-04-28 03:00:43,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {78708#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78708#(< main_~i~0 993)} is VALID [2022-04-28 03:00:43,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {78715#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78708#(< main_~i~0 993)} is VALID [2022-04-28 03:00:43,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {78715#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78715#(< main_~i~0 992)} is VALID [2022-04-28 03:00:43,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {78722#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78715#(< main_~i~0 992)} is VALID [2022-04-28 03:00:43,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {78722#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78722#(< main_~i~0 991)} is VALID [2022-04-28 03:00:43,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {78729#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78722#(< main_~i~0 991)} is VALID [2022-04-28 03:00:43,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {78729#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78729#(< main_~i~0 990)} is VALID [2022-04-28 03:00:43,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {78736#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78729#(< main_~i~0 990)} is VALID [2022-04-28 03:00:43,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {78736#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78736#(< main_~i~0 989)} is VALID [2022-04-28 03:00:43,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {78743#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78736#(< main_~i~0 989)} is VALID [2022-04-28 03:00:43,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {78743#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78743#(< main_~i~0 988)} is VALID [2022-04-28 03:00:43,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {78750#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78743#(< main_~i~0 988)} is VALID [2022-04-28 03:00:43,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {78750#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78750#(< main_~i~0 987)} is VALID [2022-04-28 03:00:43,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {78757#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78750#(< main_~i~0 987)} is VALID [2022-04-28 03:00:43,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {78757#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78757#(< main_~i~0 986)} is VALID [2022-04-28 03:00:43,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {78764#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78757#(< main_~i~0 986)} is VALID [2022-04-28 03:00:43,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {78764#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78764#(< main_~i~0 985)} is VALID [2022-04-28 03:00:43,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {78771#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78764#(< main_~i~0 985)} is VALID [2022-04-28 03:00:43,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {78771#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78771#(< main_~i~0 984)} is VALID [2022-04-28 03:00:43,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {78778#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78771#(< main_~i~0 984)} is VALID [2022-04-28 03:00:43,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {78778#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78778#(< main_~i~0 983)} is VALID [2022-04-28 03:00:43,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {78785#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78778#(< main_~i~0 983)} is VALID [2022-04-28 03:00:43,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {78785#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78785#(< main_~i~0 982)} is VALID [2022-04-28 03:00:43,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {78792#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78785#(< main_~i~0 982)} is VALID [2022-04-28 03:00:43,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {78792#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78792#(< main_~i~0 981)} is VALID [2022-04-28 03:00:43,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {78799#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78792#(< main_~i~0 981)} is VALID [2022-04-28 03:00:43,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {78799#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78799#(< main_~i~0 980)} is VALID [2022-04-28 03:00:43,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {78806#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78799#(< main_~i~0 980)} is VALID [2022-04-28 03:00:43,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {78806#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78806#(< main_~i~0 979)} is VALID [2022-04-28 03:00:43,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {78813#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78806#(< main_~i~0 979)} is VALID [2022-04-28 03:00:43,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {78813#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78813#(< main_~i~0 978)} is VALID [2022-04-28 03:00:43,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {78820#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78813#(< main_~i~0 978)} is VALID [2022-04-28 03:00:43,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {78820#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78820#(< main_~i~0 977)} is VALID [2022-04-28 03:00:43,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {78827#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78820#(< main_~i~0 977)} is VALID [2022-04-28 03:00:43,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {78827#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78827#(< main_~i~0 976)} is VALID [2022-04-28 03:00:43,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {78834#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78827#(< main_~i~0 976)} is VALID [2022-04-28 03:00:43,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {78834#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78834#(< main_~i~0 975)} is VALID [2022-04-28 03:00:43,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {78841#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78834#(< main_~i~0 975)} is VALID [2022-04-28 03:00:43,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {78841#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78841#(< main_~i~0 974)} is VALID [2022-04-28 03:00:43,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {78848#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78841#(< main_~i~0 974)} is VALID [2022-04-28 03:00:43,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {78848#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78848#(< main_~i~0 973)} is VALID [2022-04-28 03:00:43,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78848#(< main_~i~0 973)} is VALID [2022-04-28 03:00:43,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-28 03:00:43,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-28 03:00:43,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-28 03:00:43,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#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(12, 2); {78012#true} is VALID [2022-04-28 03:00:43,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-28 03:00:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:43,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281561786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:43,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:43,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-28 03:00:43,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:43,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647799106] [2022-04-28 03:00:43,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647799106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:43,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:43,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:00:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300674825] [2022-04-28 03:00:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 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 125 [2022-04-28 03:00:43,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:43,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:43,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:00:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:00:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:00:43,584 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:53,057 INFO L93 Difference]: Finished difference Result 397 states and 505 transitions. [2022-04-28 03:00:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:00:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 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 125 [2022-04-28 03:00:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-28 03:00:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-28 03:00:53,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 496 transitions. [2022-04-28 03:00:53,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:53,420 INFO L225 Difference]: With dead ends: 397 [2022-04-28 03:00:53,420 INFO L226 Difference]: Without dead ends: 380 [2022-04-28 03:00:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-28 03:00:53,422 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:53,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 52 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:00:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-04-28 03:00:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 128. [2022-04-28 03:00:54,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:54,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:54,018 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:54,018 INFO L87 Difference]: Start difference. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:54,023 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-28 03:00:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-28 03:00:54,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:54,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:54,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 380 states. [2022-04-28 03:00:54,023 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 380 states. [2022-04-28 03:00:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:54,028 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-28 03:00:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-28 03:00:54,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:54,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:54,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:54,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-28 03:00:54,030 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 125 [2022-04-28 03:00:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:54,030 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-28 03:00:54,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:54,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-28 03:00:54,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-28 03:00:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 03:00:54,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:54,320 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:54,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:54,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 03:00:54,528 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 105 times [2022-04-28 03:00:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:54,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605792931] [2022-04-28 03:00:54,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:54,533 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:00:54,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:00:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 106 times [2022-04-28 03:00:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:54,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995754918] [2022-04-28 03:00:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {80844#(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(12, 2); {80786#true} is VALID [2022-04-28 03:00:55,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-28 03:00:55,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-28 03:00:55,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:55,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {80844#(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(12, 2); {80786#true} is VALID [2022-04-28 03:00:55,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-28 03:00:55,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-28 03:00:55,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-28 03:00:55,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80791#(= main_~i~0 0)} is VALID [2022-04-28 03:00:55,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {80791#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80791#(= main_~i~0 0)} is VALID [2022-04-28 03:00:55,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {80791#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:55,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:55,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:55,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:55,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:55,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:55,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:55,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:55,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:55,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:55,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:55,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:55,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:55,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:55,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:55,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:55,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:55,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:55,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:55,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:55,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:55,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:55,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:55,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:55,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:55,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:55,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:55,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:55,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:55,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:55,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:55,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:55,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:55,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:55,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:55,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:55,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:55,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:55,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:55,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:55,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:55,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:55,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:55,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:55,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:55,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:55,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:55,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:55,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:55,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:55,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:55,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:55,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:55,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:55,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:55,438 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:55,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:55,438 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:55,438 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:55,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:55,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:55,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:55,439 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:55,439 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:55,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:55,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:55,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:55,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:55,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:55,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:55,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:55,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:55,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:55,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:55,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:55,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:55,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:55,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:55,443 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:55,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:55,443 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:55,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:55,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:55,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:55,444 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:55,444 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:55,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:55,445 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:55,445 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:55,445 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:55,445 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:55,446 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:55,446 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:55,446 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:55,446 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:55,446 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:55,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:55,447 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:55,447 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:55,447 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:55,448 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-28 03:00:55,449 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-28 03:00:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995754918] [2022-04-28 03:00:55,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995754918] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367599489] [2022-04-28 03:00:55,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:55,451 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:00:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 03:00:55,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:55,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:55,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 03:00:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:56,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-28 03:00:56,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#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(12, 2); {80786#true} is VALID [2022-04-28 03:00:56,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-28 03:00:56,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-28 03:00:56,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-28 03:00:56,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80863#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:56,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {80863#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80863#(<= main_~i~0 0)} is VALID [2022-04-28 03:00:56,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {80863#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:56,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-28 03:00:56,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:56,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-28 03:00:56,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:56,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-28 03:00:56,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:56,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-28 03:00:56,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:56,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-28 03:00:56,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:56,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-28 03:00:56,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:56,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-28 03:00:56,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:56,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-28 03:00:56,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:56,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-28 03:00:56,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:56,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-28 03:00:56,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:56,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-28 03:00:56,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:56,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-28 03:00:56,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:56,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-28 03:00:56,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:56,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-28 03:00:56,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:56,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-28 03:00:56,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:56,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-28 03:00:56,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:56,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-28 03:00:56,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:56,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-28 03:00:56,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:56,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-28 03:00:56,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:56,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-28 03:00:56,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:56,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-28 03:00:56,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:56,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-28 03:00:56,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:56,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-28 03:00:56,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:56,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-28 03:00:56,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:56,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-28 03:00:56,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:56,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-28 03:00:56,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:56,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-28 03:00:56,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:56,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-28 03:00:56,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:56,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-28 03:00:56,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:56,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-28 03:00:56,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:56,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-28 03:00:56,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:56,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-28 03:00:56,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:56,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-28 03:00:56,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:56,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-28 03:00:56,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:56,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-28 03:00:56,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:56,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-28 03:00:56,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:56,210 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-28 03:00:56,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:56,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-28 03:00:56,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:56,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-28 03:00:56,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:56,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-28 03:00:56,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:56,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-28 03:00:56,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:56,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-28 03:00:56,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:56,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-28 03:00:56,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:56,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-28 03:00:56,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:56,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-28 03:00:56,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:56,214 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-28 03:00:56,214 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:56,215 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-28 03:00:56,215 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:56,215 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-28 03:00:56,215 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:56,216 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-28 03:00:56,216 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:56,216 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-28 03:00:56,216 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:56,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:56,217 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-28 03:00:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:56,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:58,224 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-28 03:00:58,224 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-28 03:00:58,224 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-28 03:00:58,224 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-28 03:00:58,224 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-28 03:00:58,225 INFO L290 TraceCheckUtils]: 110: Hoare triple {81275#(< main_~i~0 1024)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-28 03:00:58,226 INFO L290 TraceCheckUtils]: 109: Hoare triple {81279#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81275#(< main_~i~0 1024)} is VALID [2022-04-28 03:00:58,226 INFO L290 TraceCheckUtils]: 108: Hoare triple {81279#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81279#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:58,226 INFO L290 TraceCheckUtils]: 107: Hoare triple {81286#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81279#(< main_~i~0 1023)} is VALID [2022-04-28 03:00:58,226 INFO L290 TraceCheckUtils]: 106: Hoare triple {81286#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81286#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:58,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {81293#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81286#(< main_~i~0 1022)} is VALID [2022-04-28 03:00:58,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {81293#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81293#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:58,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {81300#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81293#(< main_~i~0 1021)} is VALID [2022-04-28 03:00:58,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {81300#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81300#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:58,228 INFO L290 TraceCheckUtils]: 101: Hoare triple {81307#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81300#(< main_~i~0 1020)} is VALID [2022-04-28 03:00:58,228 INFO L290 TraceCheckUtils]: 100: Hoare triple {81307#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81307#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:58,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {81314#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(< main_~i~0 1019)} is VALID [2022-04-28 03:00:58,235 INFO L290 TraceCheckUtils]: 98: Hoare triple {81314#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81314#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:58,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {81321#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(< main_~i~0 1018)} is VALID [2022-04-28 03:00:58,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {81321#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81321#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:58,237 INFO L290 TraceCheckUtils]: 95: Hoare triple {81328#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(< main_~i~0 1017)} is VALID [2022-04-28 03:00:58,237 INFO L290 TraceCheckUtils]: 94: Hoare triple {81328#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81328#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:58,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {81335#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(< main_~i~0 1016)} is VALID [2022-04-28 03:00:58,238 INFO L290 TraceCheckUtils]: 92: Hoare triple {81335#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81335#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:58,238 INFO L290 TraceCheckUtils]: 91: Hoare triple {81342#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(< main_~i~0 1015)} is VALID [2022-04-28 03:00:58,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {81342#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81342#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:58,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {81349#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(< main_~i~0 1014)} is VALID [2022-04-28 03:00:58,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {81349#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81349#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:58,240 INFO L290 TraceCheckUtils]: 87: Hoare triple {81356#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(< main_~i~0 1013)} is VALID [2022-04-28 03:00:58,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {81356#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81356#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:58,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {81363#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(< main_~i~0 1012)} is VALID [2022-04-28 03:00:58,241 INFO L290 TraceCheckUtils]: 84: Hoare triple {81363#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81363#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:58,241 INFO L290 TraceCheckUtils]: 83: Hoare triple {81370#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81363#(< main_~i~0 1011)} is VALID [2022-04-28 03:00:58,241 INFO L290 TraceCheckUtils]: 82: Hoare triple {81370#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81370#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:58,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {81377#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81370#(< main_~i~0 1010)} is VALID [2022-04-28 03:00:58,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {81377#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81377#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:58,242 INFO L290 TraceCheckUtils]: 79: Hoare triple {81384#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81377#(< main_~i~0 1009)} is VALID [2022-04-28 03:00:58,243 INFO L290 TraceCheckUtils]: 78: Hoare triple {81384#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81384#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:58,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {81391#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81384#(< main_~i~0 1008)} is VALID [2022-04-28 03:00:58,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {81391#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81391#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:58,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {81398#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81391#(< main_~i~0 1007)} is VALID [2022-04-28 03:00:58,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {81398#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81398#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:58,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {81405#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81398#(< main_~i~0 1006)} is VALID [2022-04-28 03:00:58,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {81405#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81405#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:58,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {81412#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81405#(< main_~i~0 1005)} is VALID [2022-04-28 03:00:58,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {81412#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81412#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:58,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {81419#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81412#(< main_~i~0 1004)} is VALID [2022-04-28 03:00:58,246 INFO L290 TraceCheckUtils]: 68: Hoare triple {81419#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81419#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:58,247 INFO L290 TraceCheckUtils]: 67: Hoare triple {81426#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81419#(< main_~i~0 1003)} is VALID [2022-04-28 03:00:58,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {81426#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81426#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:58,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {81433#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81426#(< main_~i~0 1002)} is VALID [2022-04-28 03:00:58,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {81433#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81433#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:58,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {81440#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81433#(< main_~i~0 1001)} is VALID [2022-04-28 03:00:58,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {81440#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81440#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:58,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {81447#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81440#(< main_~i~0 1000)} is VALID [2022-04-28 03:00:58,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {81447#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81447#(< main_~i~0 999)} is VALID [2022-04-28 03:00:58,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {81454#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81447#(< main_~i~0 999)} is VALID [2022-04-28 03:00:58,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {81454#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81454#(< main_~i~0 998)} is VALID [2022-04-28 03:00:58,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {81461#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81454#(< main_~i~0 998)} is VALID [2022-04-28 03:00:58,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {81461#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81461#(< main_~i~0 997)} is VALID [2022-04-28 03:00:58,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {81468#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81461#(< main_~i~0 997)} is VALID [2022-04-28 03:00:58,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {81468#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81468#(< main_~i~0 996)} is VALID [2022-04-28 03:00:58,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {81475#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81468#(< main_~i~0 996)} is VALID [2022-04-28 03:00:58,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {81475#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81475#(< main_~i~0 995)} is VALID [2022-04-28 03:00:58,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {81482#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81475#(< main_~i~0 995)} is VALID [2022-04-28 03:00:58,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {81482#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81482#(< main_~i~0 994)} is VALID [2022-04-28 03:00:58,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {81489#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81482#(< main_~i~0 994)} is VALID [2022-04-28 03:00:58,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {81489#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81489#(< main_~i~0 993)} is VALID [2022-04-28 03:00:58,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {81496#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81489#(< main_~i~0 993)} is VALID [2022-04-28 03:00:58,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {81496#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81496#(< main_~i~0 992)} is VALID [2022-04-28 03:00:58,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {81503#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81496#(< main_~i~0 992)} is VALID [2022-04-28 03:00:58,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {81503#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81503#(< main_~i~0 991)} is VALID [2022-04-28 03:00:58,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {81510#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81503#(< main_~i~0 991)} is VALID [2022-04-28 03:00:58,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {81510#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81510#(< main_~i~0 990)} is VALID [2022-04-28 03:00:58,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {81517#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81510#(< main_~i~0 990)} is VALID [2022-04-28 03:00:58,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {81517#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81517#(< main_~i~0 989)} is VALID [2022-04-28 03:00:58,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {81524#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81517#(< main_~i~0 989)} is VALID [2022-04-28 03:00:58,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {81524#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81524#(< main_~i~0 988)} is VALID [2022-04-28 03:00:58,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {81531#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81524#(< main_~i~0 988)} is VALID [2022-04-28 03:00:58,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {81531#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81531#(< main_~i~0 987)} is VALID [2022-04-28 03:00:58,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {81538#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81531#(< main_~i~0 987)} is VALID [2022-04-28 03:00:58,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {81538#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81538#(< main_~i~0 986)} is VALID [2022-04-28 03:00:58,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {81545#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81538#(< main_~i~0 986)} is VALID [2022-04-28 03:00:58,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {81545#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81545#(< main_~i~0 985)} is VALID [2022-04-28 03:00:58,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {81552#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81545#(< main_~i~0 985)} is VALID [2022-04-28 03:00:58,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {81552#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81552#(< main_~i~0 984)} is VALID [2022-04-28 03:00:58,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {81559#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81552#(< main_~i~0 984)} is VALID [2022-04-28 03:00:58,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {81559#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81559#(< main_~i~0 983)} is VALID [2022-04-28 03:00:58,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {81566#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81559#(< main_~i~0 983)} is VALID [2022-04-28 03:00:58,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {81566#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81566#(< main_~i~0 982)} is VALID [2022-04-28 03:00:58,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {81573#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81566#(< main_~i~0 982)} is VALID [2022-04-28 03:00:58,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {81573#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81573#(< main_~i~0 981)} is VALID [2022-04-28 03:00:58,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {81580#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81573#(< main_~i~0 981)} is VALID [2022-04-28 03:00:58,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {81580#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81580#(< main_~i~0 980)} is VALID [2022-04-28 03:00:58,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {81587#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81580#(< main_~i~0 980)} is VALID [2022-04-28 03:00:58,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {81587#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81587#(< main_~i~0 979)} is VALID [2022-04-28 03:00:58,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {81594#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81587#(< main_~i~0 979)} is VALID [2022-04-28 03:00:58,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {81594#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81594#(< main_~i~0 978)} is VALID [2022-04-28 03:00:58,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {81601#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81594#(< main_~i~0 978)} is VALID [2022-04-28 03:00:58,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {81601#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81601#(< main_~i~0 977)} is VALID [2022-04-28 03:00:58,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {81608#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81601#(< main_~i~0 977)} is VALID [2022-04-28 03:00:58,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {81608#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81608#(< main_~i~0 976)} is VALID [2022-04-28 03:00:58,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {81615#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81608#(< main_~i~0 976)} is VALID [2022-04-28 03:00:58,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {81615#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81615#(< main_~i~0 975)} is VALID [2022-04-28 03:00:58,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {81622#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81615#(< main_~i~0 975)} is VALID [2022-04-28 03:00:58,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {81622#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81622#(< main_~i~0 974)} is VALID [2022-04-28 03:00:58,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {81629#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81622#(< main_~i~0 974)} is VALID [2022-04-28 03:00:58,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {81629#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81629#(< main_~i~0 973)} is VALID [2022-04-28 03:00:58,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {81636#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81629#(< main_~i~0 973)} is VALID [2022-04-28 03:00:58,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {81636#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81636#(< main_~i~0 972)} is VALID [2022-04-28 03:00:58,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81636#(< main_~i~0 972)} is VALID [2022-04-28 03:00:58,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-28 03:00:58,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-28 03:00:58,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-28 03:00:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#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(12, 2); {80786#true} is VALID [2022-04-28 03:00:58,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-28 03:00:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:00:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367599489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:58,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:58,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-28 03:00:58,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1605792931] [2022-04-28 03:00:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1605792931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:58,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:58,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:00:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325236753] [2022-04-28 03:00:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 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 127 [2022-04-28 03:00:58,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:58,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:58,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:00:58,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:00:58,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:00:58,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:00:58,352 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:08,986 INFO L93 Difference]: Finished difference Result 404 states and 514 transitions. [2022-04-28 03:01:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:01:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 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 127 [2022-04-28 03:01:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-28 03:01:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-28 03:01:08,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 505 transitions. [2022-04-28 03:01:09,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:09,228 INFO L225 Difference]: With dead ends: 404 [2022-04-28 03:01:09,228 INFO L226 Difference]: Without dead ends: 387 [2022-04-28 03:01:09,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:01:09,229 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:09,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 47 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:01:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-28 03:01:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 130. [2022-04-28 03:01:09,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:09,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:09,827 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:09,827 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:09,832 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-28 03:01:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-28 03:01:09,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:09,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:09,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 03:01:09,833 INFO L87 Difference]: Start difference. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 03:01:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:09,839 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-28 03:01:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-28 03:01:09,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:09,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:09,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:09,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-04-28 03:01:09,840 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2022-04-28 03:01:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:09,841 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-04-28 03:01:09,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:09,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 134 transitions. [2022-04-28 03:01:10,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-28 03:01:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 03:01:10,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:10,136 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:10,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 03:01:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:10,351 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 107 times [2022-04-28 03:01:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:10,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791308858] [2022-04-28 03:01:10,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:10,373 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:10,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 108 times [2022-04-28 03:01:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494942745] [2022-04-28 03:01:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:11,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:11,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {83667#(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(12, 2); {83608#true} is VALID [2022-04-28 03:01:11,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-28 03:01:11,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-28 03:01:11,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:11,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {83667#(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(12, 2); {83608#true} is VALID [2022-04-28 03:01:11,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-28 03:01:11,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-28 03:01:11,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-28 03:01:11,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83613#(= main_~i~0 0)} is VALID [2022-04-28 03:01:11,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {83613#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83613#(= main_~i~0 0)} is VALID [2022-04-28 03:01:11,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:11,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:11,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {83614#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:11,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {83615#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:11,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {83615#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83616#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:11,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {83616#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83616#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:11,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {83616#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83617#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:11,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {83617#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83617#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:11,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {83617#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83618#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:11,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {83618#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83618#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:11,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {83618#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83619#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:11,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {83619#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83619#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:11,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {83619#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83620#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:11,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {83620#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83620#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:11,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {83620#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83621#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:11,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {83621#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83621#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:11,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {83621#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83622#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:11,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {83622#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83622#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:11,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {83622#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83623#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:11,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {83623#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83623#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:11,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {83623#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83624#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:11,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {83624#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83624#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:11,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {83624#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83625#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:11,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {83625#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83625#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:11,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {83625#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83626#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:11,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {83626#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83626#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:11,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {83626#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83627#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:11,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {83627#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83627#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:11,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {83627#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83628#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:11,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {83628#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83628#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:11,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {83628#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83629#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:11,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {83629#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83629#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:11,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {83629#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83630#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:11,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {83630#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83630#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:11,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {83630#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83631#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:11,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {83631#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83631#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:11,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {83631#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83632#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:11,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {83632#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83632#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:11,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {83632#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83633#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:11,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {83633#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83633#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:11,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {83633#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83634#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:11,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {83634#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83634#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:11,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {83634#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83635#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:11,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {83635#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83635#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:11,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {83635#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83636#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:11,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {83636#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83636#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:11,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {83636#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83637#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:11,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {83637#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83637#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:11,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {83637#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83638#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:11,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {83638#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83638#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:11,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {83638#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83639#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:11,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {83639#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83639#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:11,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {83639#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83640#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:11,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {83640#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83640#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:11,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {83640#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83641#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:11,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {83641#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83641#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:11,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {83641#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83642#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:11,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {83642#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83642#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:11,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {83642#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83643#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:11,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {83643#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83643#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:11,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {83643#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83644#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:11,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {83644#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83644#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:11,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {83644#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83645#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:11,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {83645#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83645#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:11,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {83645#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83646#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:11,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {83646#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83646#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:11,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {83646#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83647#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:11,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {83647#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83647#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:11,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {83647#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83648#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:11,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {83648#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83648#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:11,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {83648#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83649#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:11,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {83649#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83649#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:11,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {83649#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83650#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:11,272 INFO L290 TraceCheckUtils]: 80: Hoare triple {83650#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83650#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:11,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {83650#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83651#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:11,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {83651#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83651#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:11,273 INFO L290 TraceCheckUtils]: 83: Hoare triple {83651#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83652#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:11,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {83652#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83652#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:11,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {83652#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83653#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:11,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {83653#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83653#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:11,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {83653#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83654#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:11,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {83654#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83654#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:11,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {83654#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83655#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:11,276 INFO L290 TraceCheckUtils]: 90: Hoare triple {83655#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83655#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:11,276 INFO L290 TraceCheckUtils]: 91: Hoare triple {83655#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83656#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:11,276 INFO L290 TraceCheckUtils]: 92: Hoare triple {83656#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83656#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:11,277 INFO L290 TraceCheckUtils]: 93: Hoare triple {83656#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83657#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:11,277 INFO L290 TraceCheckUtils]: 94: Hoare triple {83657#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83657#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:11,277 INFO L290 TraceCheckUtils]: 95: Hoare triple {83657#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83658#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:11,278 INFO L290 TraceCheckUtils]: 96: Hoare triple {83658#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83658#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:11,278 INFO L290 TraceCheckUtils]: 97: Hoare triple {83658#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83659#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:11,278 INFO L290 TraceCheckUtils]: 98: Hoare triple {83659#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83659#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:11,279 INFO L290 TraceCheckUtils]: 99: Hoare triple {83659#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83660#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:11,279 INFO L290 TraceCheckUtils]: 100: Hoare triple {83660#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83660#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:11,279 INFO L290 TraceCheckUtils]: 101: Hoare triple {83660#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83661#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:11,280 INFO L290 TraceCheckUtils]: 102: Hoare triple {83661#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83661#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:11,280 INFO L290 TraceCheckUtils]: 103: Hoare triple {83661#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83662#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:11,280 INFO L290 TraceCheckUtils]: 104: Hoare triple {83662#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83662#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:11,281 INFO L290 TraceCheckUtils]: 105: Hoare triple {83662#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83663#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:11,281 INFO L290 TraceCheckUtils]: 106: Hoare triple {83663#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83663#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:11,281 INFO L290 TraceCheckUtils]: 107: Hoare triple {83663#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83664#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:11,282 INFO L290 TraceCheckUtils]: 108: Hoare triple {83664#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83664#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:11,282 INFO L290 TraceCheckUtils]: 109: Hoare triple {83664#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83665#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:11,282 INFO L290 TraceCheckUtils]: 110: Hoare triple {83665#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83665#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 111: Hoare triple {83665#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83666#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 112: Hoare triple {83666#(<= main_~i~0 53)} assume !(~i~0 < 1024); {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 113: Hoare triple {83609#false} ~i~0 := 0; {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 114: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 115: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 116: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 117: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-28 03:01:11,283 INFO L290 TraceCheckUtils]: 118: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 119: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 120: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 121: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 122: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 123: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 124: Hoare triple {83609#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L272 TraceCheckUtils]: 125: Hoare triple {83609#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 126: Hoare triple {83609#false} ~cond := #in~cond; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 127: Hoare triple {83609#false} assume 0 == ~cond; {83609#false} is VALID [2022-04-28 03:01:11,284 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-28 03:01:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494942745] [2022-04-28 03:01:11,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494942745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724931448] [2022-04-28 03:01:11,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:11,286 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:11,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 03:01:11,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:01:11,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:11,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:01:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:11,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:11,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#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(12, 2); {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,997 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:11,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-28 03:01:11,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84010#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:11,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {84010#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {84010#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:12,000 INFO L290 TraceCheckUtils]: 115: Hoare triple {84010#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84010#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:12,000 INFO L290 TraceCheckUtils]: 116: Hoare triple {84010#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84010#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:12,000 INFO L290 TraceCheckUtils]: 117: Hoare triple {84010#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:12,001 INFO L290 TraceCheckUtils]: 118: Hoare triple {83614#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:12,001 INFO L290 TraceCheckUtils]: 119: Hoare triple {83614#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:12,001 INFO L290 TraceCheckUtils]: 120: Hoare triple {83614#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83614#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:12,002 INFO L290 TraceCheckUtils]: 121: Hoare triple {83614#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:12,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {83615#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:12,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {83615#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:12,003 INFO L290 TraceCheckUtils]: 124: Hoare triple {83615#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83615#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:12,003 INFO L272 TraceCheckUtils]: 125: Hoare triple {83615#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:01:12,004 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:01:12,004 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-28 03:01:12,004 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-28 03:01:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-28 03:01:12,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:12,366 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-28 03:01:12,367 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-28 03:01:12,367 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:01:12,368 INFO L272 TraceCheckUtils]: 125: Hoare triple {84067#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:01:12,368 INFO L290 TraceCheckUtils]: 124: Hoare triple {84067#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {84067#(<= main_~i~0 512)} is VALID [2022-04-28 03:01:12,368 INFO L290 TraceCheckUtils]: 123: Hoare triple {84067#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84067#(<= main_~i~0 512)} is VALID [2022-04-28 03:01:12,369 INFO L290 TraceCheckUtils]: 122: Hoare triple {84067#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {84067#(<= main_~i~0 512)} is VALID [2022-04-28 03:01:12,369 INFO L290 TraceCheckUtils]: 121: Hoare triple {84080#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84067#(<= main_~i~0 512)} is VALID [2022-04-28 03:01:12,369 INFO L290 TraceCheckUtils]: 120: Hoare triple {84080#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84080#(<= main_~i~0 511)} is VALID [2022-04-28 03:01:12,370 INFO L290 TraceCheckUtils]: 119: Hoare triple {84080#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84080#(<= main_~i~0 511)} is VALID [2022-04-28 03:01:12,370 INFO L290 TraceCheckUtils]: 118: Hoare triple {84080#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {84080#(<= main_~i~0 511)} is VALID [2022-04-28 03:01:12,370 INFO L290 TraceCheckUtils]: 117: Hoare triple {84093#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84080#(<= main_~i~0 511)} is VALID [2022-04-28 03:01:12,370 INFO L290 TraceCheckUtils]: 116: Hoare triple {84093#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84093#(<= main_~i~0 510)} is VALID [2022-04-28 03:01:12,371 INFO L290 TraceCheckUtils]: 115: Hoare triple {84093#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84093#(<= main_~i~0 510)} is VALID [2022-04-28 03:01:12,371 INFO L290 TraceCheckUtils]: 114: Hoare triple {84093#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {84093#(<= main_~i~0 510)} is VALID [2022-04-28 03:01:12,371 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84093#(<= main_~i~0 510)} is VALID [2022-04-28 03:01:12,371 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-28 03:01:12,371 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,372 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-28 03:01:12,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-28 03:01:12,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-28 03:01:12,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-28 03:01:12,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#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(12, 2); {83608#true} is VALID [2022-04-28 03:01:12,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-28 03:01:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-28 03:01:12,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724931448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:12,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:12,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 63 [2022-04-28 03:01:12,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791308858] [2022-04-28 03:01:12,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791308858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:12,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:12,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:01:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399264972] [2022-04-28 03:01:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 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 129 [2022-04-28 03:01:12,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:12,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:12,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:01:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:01:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2130, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:01:12,455 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:23,191 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-04-28 03:01:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:01:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 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 129 [2022-04-28 03:01:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-28 03:01:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-28 03:01:23,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 514 transitions. [2022-04-28 03:01:23,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:23,571 INFO L225 Difference]: With dead ends: 411 [2022-04-28 03:01:23,571 INFO L226 Difference]: Without dead ends: 394 [2022-04-28 03:01:23,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5017, Invalid=8555, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:01:23,582 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1315 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:23,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 32 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:01:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-28 03:01:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 132. [2022-04-28 03:01:24,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:24,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:24,270 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:24,270 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:24,275 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-28 03:01:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-28 03:01:24,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:24,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:24,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-28 03:01:24,276 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-28 03:01:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:24,281 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-28 03:01:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-28 03:01:24,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:24,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:24,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:24,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-04-28 03:01:24,283 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 129 [2022-04-28 03:01:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:24,283 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-04-28 03:01:24,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:24,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 136 transitions. [2022-04-28 03:01:24,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-04-28 03:01:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 03:01:24,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:24,601 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:24,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-28 03:01:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:24,815 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 109 times [2022-04-28 03:01:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:24,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330820264] [2022-04-28 03:01:24,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:24,830 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:24,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 110 times [2022-04-28 03:01:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170837670] [2022-04-28 03:01:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:25,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {86489#(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(12, 2); {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:25,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {86489#(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(12, 2); {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-28 03:01:25,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-28 03:01:25,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86434#(= main_~i~0 0)} is VALID [2022-04-28 03:01:25,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {86434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86434#(= main_~i~0 0)} is VALID [2022-04-28 03:01:25,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {86434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:25,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:25,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:25,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:25,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:25,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:25,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:25,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:25,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:25,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:25,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:25,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:25,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:25,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:25,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:25,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:25,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:25,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:25,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:25,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:25,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:25,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:25,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:25,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:25,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:25,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:25,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:25,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:25,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:25,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:25,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:25,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:25,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:25,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:25,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:25,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:25,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:25,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:25,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:25,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:25,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:25,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:25,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:25,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:25,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:25,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:25,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:25,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:25,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:25,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:25,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:25,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:25,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:25,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:25,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:25,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:25,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:25,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:25,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:25,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:25,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:25,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:25,984 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:25,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:25,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:25,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:25,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:25,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:25,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:25,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:25,987 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:25,987 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:25,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:25,988 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:25,988 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:25,989 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:25,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:25,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:25,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:25,990 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:25,990 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:25,990 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:25,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:25,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:25,991 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:25,992 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:25,992 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:25,992 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:25,993 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:25,993 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:25,993 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:25,994 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:25,994 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:25,994 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:25,995 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:25,995 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:25,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:25,996 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:25,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:25,997 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:25,997 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:25,997 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:25,998 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:25,998 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:25,998 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:25,999 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:25,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:25,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-28 03:01:25,999 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-28 03:01:26,000 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-28 03:01:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170837670] [2022-04-28 03:01:26,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170837670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888227935] [2022-04-28 03:01:26,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:26,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:26,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:26,004 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:26,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 03:01:26,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:26,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:26,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 03:01:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:26,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:26,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-28 03:01:26,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#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(12, 2); {86429#true} is VALID [2022-04-28 03:01:26,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-28 03:01:26,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-28 03:01:26,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-28 03:01:26,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86508#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:26,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {86508#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86508#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:26,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {86508#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:26,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:26,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:26,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:26,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:26,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:26,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:26,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:26,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:26,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:26,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:26,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:26,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:26,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:26,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:26,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:26,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:26,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:26,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:26,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:26,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:26,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:26,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:26,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:26,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:26,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:26,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:26,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:26,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:26,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:26,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:26,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:26,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:26,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:26,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:26,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:26,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:26,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:26,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:26,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:26,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:26,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:26,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:26,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:26,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:26,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:26,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:26,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:26,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:26,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:26,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:26,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:26,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:26,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:26,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:26,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:26,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:26,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:26,981 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:26,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:26,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:26,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:26,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:26,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:26,982 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:26,982 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:26,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:26,983 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:26,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:26,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:26,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:26,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:26,984 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:26,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:26,984 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:26,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:26,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:26,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:26,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:26,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:26,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:26,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:26,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:26,987 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:26,987 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:26,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:26,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:26,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:26,988 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:26,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:26,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:26,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:26,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:26,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:26,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:26,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:26,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:26,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:26,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:26,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:26,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:26,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:26,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:26,991 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:26,991 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,992 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-28 03:01:26,993 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-28 03:01:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:26,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:29,570 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-28 03:01:29,571 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 114: Hoare triple {86932#(< main_~i~0 1024)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 113: Hoare triple {86936#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86932#(< main_~i~0 1024)} is VALID [2022-04-28 03:01:29,572 INFO L290 TraceCheckUtils]: 112: Hoare triple {86936#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86936#(< main_~i~0 1023)} is VALID [2022-04-28 03:01:29,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {86943#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86936#(< main_~i~0 1023)} is VALID [2022-04-28 03:01:29,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {86943#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86943#(< main_~i~0 1022)} is VALID [2022-04-28 03:01:29,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {86950#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86943#(< main_~i~0 1022)} is VALID [2022-04-28 03:01:29,573 INFO L290 TraceCheckUtils]: 108: Hoare triple {86950#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86950#(< main_~i~0 1021)} is VALID [2022-04-28 03:01:29,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {86957#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86950#(< main_~i~0 1021)} is VALID [2022-04-28 03:01:29,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {86957#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86957#(< main_~i~0 1020)} is VALID [2022-04-28 03:01:29,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {86964#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86957#(< main_~i~0 1020)} is VALID [2022-04-28 03:01:29,574 INFO L290 TraceCheckUtils]: 104: Hoare triple {86964#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86964#(< main_~i~0 1019)} is VALID [2022-04-28 03:01:29,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {86971#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86964#(< main_~i~0 1019)} is VALID [2022-04-28 03:01:29,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {86971#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86971#(< main_~i~0 1018)} is VALID [2022-04-28 03:01:29,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {86978#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86971#(< main_~i~0 1018)} is VALID [2022-04-28 03:01:29,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {86978#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86978#(< main_~i~0 1017)} is VALID [2022-04-28 03:01:29,576 INFO L290 TraceCheckUtils]: 99: Hoare triple {86985#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86978#(< main_~i~0 1017)} is VALID [2022-04-28 03:01:29,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {86985#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86985#(< main_~i~0 1016)} is VALID [2022-04-28 03:01:29,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {86992#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86985#(< main_~i~0 1016)} is VALID [2022-04-28 03:01:29,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {86992#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86992#(< main_~i~0 1015)} is VALID [2022-04-28 03:01:29,576 INFO L290 TraceCheckUtils]: 95: Hoare triple {86999#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86992#(< main_~i~0 1015)} is VALID [2022-04-28 03:01:29,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {86999#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86999#(< main_~i~0 1014)} is VALID [2022-04-28 03:01:29,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {87006#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86999#(< main_~i~0 1014)} is VALID [2022-04-28 03:01:29,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {87006#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87006#(< main_~i~0 1013)} is VALID [2022-04-28 03:01:29,577 INFO L290 TraceCheckUtils]: 91: Hoare triple {87013#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87006#(< main_~i~0 1013)} is VALID [2022-04-28 03:01:29,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {87013#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87013#(< main_~i~0 1012)} is VALID [2022-04-28 03:01:29,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {87020#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87013#(< main_~i~0 1012)} is VALID [2022-04-28 03:01:29,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {87020#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87020#(< main_~i~0 1011)} is VALID [2022-04-28 03:01:29,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {87027#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87020#(< main_~i~0 1011)} is VALID [2022-04-28 03:01:29,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {87027#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87027#(< main_~i~0 1010)} is VALID [2022-04-28 03:01:29,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {87034#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87027#(< main_~i~0 1010)} is VALID [2022-04-28 03:01:29,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {87034#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87034#(< main_~i~0 1009)} is VALID [2022-04-28 03:01:29,579 INFO L290 TraceCheckUtils]: 83: Hoare triple {87041#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87034#(< main_~i~0 1009)} is VALID [2022-04-28 03:01:29,579 INFO L290 TraceCheckUtils]: 82: Hoare triple {87041#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87041#(< main_~i~0 1008)} is VALID [2022-04-28 03:01:29,580 INFO L290 TraceCheckUtils]: 81: Hoare triple {87048#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87041#(< main_~i~0 1008)} is VALID [2022-04-28 03:01:29,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {87048#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87048#(< main_~i~0 1007)} is VALID [2022-04-28 03:01:29,580 INFO L290 TraceCheckUtils]: 79: Hoare triple {87055#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87048#(< main_~i~0 1007)} is VALID [2022-04-28 03:01:29,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {87055#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87055#(< main_~i~0 1006)} is VALID [2022-04-28 03:01:29,581 INFO L290 TraceCheckUtils]: 77: Hoare triple {87062#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87055#(< main_~i~0 1006)} is VALID [2022-04-28 03:01:29,581 INFO L290 TraceCheckUtils]: 76: Hoare triple {87062#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87062#(< main_~i~0 1005)} is VALID [2022-04-28 03:01:29,581 INFO L290 TraceCheckUtils]: 75: Hoare triple {87069#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87062#(< main_~i~0 1005)} is VALID [2022-04-28 03:01:29,581 INFO L290 TraceCheckUtils]: 74: Hoare triple {87069#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87069#(< main_~i~0 1004)} is VALID [2022-04-28 03:01:29,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {87076#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87069#(< main_~i~0 1004)} is VALID [2022-04-28 03:01:29,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {87076#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87076#(< main_~i~0 1003)} is VALID [2022-04-28 03:01:29,582 INFO L290 TraceCheckUtils]: 71: Hoare triple {87083#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87076#(< main_~i~0 1003)} is VALID [2022-04-28 03:01:29,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {87083#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87083#(< main_~i~0 1002)} is VALID [2022-04-28 03:01:29,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {87090#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87083#(< main_~i~0 1002)} is VALID [2022-04-28 03:01:29,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {87090#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87090#(< main_~i~0 1001)} is VALID [2022-04-28 03:01:29,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {87097#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87090#(< main_~i~0 1001)} is VALID [2022-04-28 03:01:29,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {87097#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87097#(< main_~i~0 1000)} is VALID [2022-04-28 03:01:29,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {87104#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87097#(< main_~i~0 1000)} is VALID [2022-04-28 03:01:29,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {87104#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87104#(< main_~i~0 999)} is VALID [2022-04-28 03:01:29,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {87111#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87104#(< main_~i~0 999)} is VALID [2022-04-28 03:01:29,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {87111#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87111#(< main_~i~0 998)} is VALID [2022-04-28 03:01:29,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {87118#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87111#(< main_~i~0 998)} is VALID [2022-04-28 03:01:29,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {87118#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87118#(< main_~i~0 997)} is VALID [2022-04-28 03:01:29,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {87125#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87118#(< main_~i~0 997)} is VALID [2022-04-28 03:01:29,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {87125#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87125#(< main_~i~0 996)} is VALID [2022-04-28 03:01:29,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {87132#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87125#(< main_~i~0 996)} is VALID [2022-04-28 03:01:29,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {87132#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87132#(< main_~i~0 995)} is VALID [2022-04-28 03:01:29,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {87139#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87132#(< main_~i~0 995)} is VALID [2022-04-28 03:01:29,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {87139#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87139#(< main_~i~0 994)} is VALID [2022-04-28 03:01:29,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {87146#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87139#(< main_~i~0 994)} is VALID [2022-04-28 03:01:29,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {87146#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87146#(< main_~i~0 993)} is VALID [2022-04-28 03:01:29,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {87153#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87146#(< main_~i~0 993)} is VALID [2022-04-28 03:01:29,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {87153#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87153#(< main_~i~0 992)} is VALID [2022-04-28 03:01:29,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {87160#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87153#(< main_~i~0 992)} is VALID [2022-04-28 03:01:29,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {87160#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87160#(< main_~i~0 991)} is VALID [2022-04-28 03:01:29,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {87167#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87160#(< main_~i~0 991)} is VALID [2022-04-28 03:01:29,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {87167#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87167#(< main_~i~0 990)} is VALID [2022-04-28 03:01:29,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {87174#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87167#(< main_~i~0 990)} is VALID [2022-04-28 03:01:29,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {87174#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87174#(< main_~i~0 989)} is VALID [2022-04-28 03:01:29,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {87181#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87174#(< main_~i~0 989)} is VALID [2022-04-28 03:01:29,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {87181#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87181#(< main_~i~0 988)} is VALID [2022-04-28 03:01:29,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {87188#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87181#(< main_~i~0 988)} is VALID [2022-04-28 03:01:29,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {87188#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87188#(< main_~i~0 987)} is VALID [2022-04-28 03:01:29,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {87195#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87188#(< main_~i~0 987)} is VALID [2022-04-28 03:01:29,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {87195#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87195#(< main_~i~0 986)} is VALID [2022-04-28 03:01:29,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {87202#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87195#(< main_~i~0 986)} is VALID [2022-04-28 03:01:29,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {87202#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87202#(< main_~i~0 985)} is VALID [2022-04-28 03:01:29,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {87209#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87202#(< main_~i~0 985)} is VALID [2022-04-28 03:01:29,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {87209#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87209#(< main_~i~0 984)} is VALID [2022-04-28 03:01:29,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {87216#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87209#(< main_~i~0 984)} is VALID [2022-04-28 03:01:29,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {87216#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87216#(< main_~i~0 983)} is VALID [2022-04-28 03:01:29,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {87223#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87216#(< main_~i~0 983)} is VALID [2022-04-28 03:01:29,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {87223#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87223#(< main_~i~0 982)} is VALID [2022-04-28 03:01:29,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {87230#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87223#(< main_~i~0 982)} is VALID [2022-04-28 03:01:29,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {87230#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87230#(< main_~i~0 981)} is VALID [2022-04-28 03:01:29,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {87237#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87230#(< main_~i~0 981)} is VALID [2022-04-28 03:01:29,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {87237#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87237#(< main_~i~0 980)} is VALID [2022-04-28 03:01:29,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {87244#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87237#(< main_~i~0 980)} is VALID [2022-04-28 03:01:29,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {87244#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87244#(< main_~i~0 979)} is VALID [2022-04-28 03:01:29,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {87251#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87244#(< main_~i~0 979)} is VALID [2022-04-28 03:01:29,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {87251#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87251#(< main_~i~0 978)} is VALID [2022-04-28 03:01:29,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {87258#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87251#(< main_~i~0 978)} is VALID [2022-04-28 03:01:29,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {87258#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87258#(< main_~i~0 977)} is VALID [2022-04-28 03:01:29,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {87265#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87258#(< main_~i~0 977)} is VALID [2022-04-28 03:01:29,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {87265#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87265#(< main_~i~0 976)} is VALID [2022-04-28 03:01:29,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {87272#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87265#(< main_~i~0 976)} is VALID [2022-04-28 03:01:29,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {87272#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87272#(< main_~i~0 975)} is VALID [2022-04-28 03:01:29,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {87279#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87272#(< main_~i~0 975)} is VALID [2022-04-28 03:01:29,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {87279#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87279#(< main_~i~0 974)} is VALID [2022-04-28 03:01:29,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {87286#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87279#(< main_~i~0 974)} is VALID [2022-04-28 03:01:29,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {87286#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87286#(< main_~i~0 973)} is VALID [2022-04-28 03:01:29,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {87293#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87286#(< main_~i~0 973)} is VALID [2022-04-28 03:01:29,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {87293#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87293#(< main_~i~0 972)} is VALID [2022-04-28 03:01:29,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {87300#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87293#(< main_~i~0 972)} is VALID [2022-04-28 03:01:29,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {87300#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87300#(< main_~i~0 971)} is VALID [2022-04-28 03:01:29,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {87307#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87300#(< main_~i~0 971)} is VALID [2022-04-28 03:01:29,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {87307#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87307#(< main_~i~0 970)} is VALID [2022-04-28 03:01:29,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {87307#(< main_~i~0 970)} is VALID [2022-04-28 03:01:29,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-28 03:01:29,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-28 03:01:29,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-28 03:01:29,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#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(12, 2); {86429#true} is VALID [2022-04-28 03:01:29,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-28 03:01:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:29,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888227935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:29,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:29,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-28 03:01:29,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:29,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330820264] [2022-04-28 03:01:29,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330820264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:29,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:29,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:01:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951741105] [2022-04-28 03:01:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 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 131 [2022-04-28 03:01:29,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:29,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:29,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:29,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:01:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:01:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:01:29,672 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:41,127 INFO L93 Difference]: Finished difference Result 418 states and 532 transitions. [2022-04-28 03:01:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:01:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 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 131 [2022-04-28 03:01:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-28 03:01:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-28 03:01:41,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 523 transitions. [2022-04-28 03:01:41,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:41,513 INFO L225 Difference]: With dead ends: 418 [2022-04-28 03:01:41,513 INFO L226 Difference]: Without dead ends: 401 [2022-04-28 03:01:41,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-28 03:01:41,514 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:41,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 47 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:01:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-28 03:01:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 134. [2022-04-28 03:01:42,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:42,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:42,470 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:42,470 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:42,476 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-28 03:01:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-28 03:01:42,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:42,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:42,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-28 03:01:42,476 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-28 03:01:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:42,482 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-28 03:01:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-28 03:01:42,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:42,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:42,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:42,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-28 03:01:42,484 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 131 [2022-04-28 03:01:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:42,484 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-28 03:01:42,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:42,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-28 03:01:42,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-28 03:01:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 03:01:42,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:42,806 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:42,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-28 03:01:43,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:43,024 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 111 times [2022-04-28 03:01:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156782009] [2022-04-28 03:01:43,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:43,028 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:01:43,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:01:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 112 times [2022-04-28 03:01:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122465430] [2022-04-28 03:01:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:44,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {89408#(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(12, 2); {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:44,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {89408#(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(12, 2); {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-28 03:01:44,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-28 03:01:44,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89352#(= main_~i~0 0)} is VALID [2022-04-28 03:01:44,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {89352#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89352#(= main_~i~0 0)} is VALID [2022-04-28 03:01:44,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {89352#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:44,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:44,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:44,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:44,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:44,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:44,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:44,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:44,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:44,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:44,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:44,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:44,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:44,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:44,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:44,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:44,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:44,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:44,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:44,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:44,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:44,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:44,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:44,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:44,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:44,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:44,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:44,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:44,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:44,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:44,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:44,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:44,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:44,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:44,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:44,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:44,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:44,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:44,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:44,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:44,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:44,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:44,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:44,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:44,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:44,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:44,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:44,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:44,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:44,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:44,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:44,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:44,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:44,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:44,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:44,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:44,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:44,249 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:44,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:44,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:44,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:44,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:44,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:44,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:44,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:44,252 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:44,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:44,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:44,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:44,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:44,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:44,254 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:44,254 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:44,254 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:44,255 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:44,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:44,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:44,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:44,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:44,256 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:44,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:44,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:44,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:44,257 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:44,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:44,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:44,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:44,259 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:44,259 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:44,259 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:44,260 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:44,260 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:44,260 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:44,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:44,261 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:44,261 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:44,262 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:44,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:44,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:44,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:44,263 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:44,263 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:44,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:44,264 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:44,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:44,265 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:44,265 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:44,265 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:44,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-28 03:01:44,267 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-28 03:01:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122465430] [2022-04-28 03:01:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122465430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574916316] [2022-04-28 03:01:44,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:44,269 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:44,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 03:01:44,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:44,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:44,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 03:01:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:44,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:45,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-28 03:01:45,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#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(12, 2); {89347#true} is VALID [2022-04-28 03:01:45,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-28 03:01:45,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-28 03:01:45,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-28 03:01:45,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89427#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:45,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {89427#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89427#(<= main_~i~0 0)} is VALID [2022-04-28 03:01:45,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {89427#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:45,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-28 03:01:45,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:45,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-28 03:01:45,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:45,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-28 03:01:45,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:45,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-28 03:01:45,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:45,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-28 03:01:45,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:45,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-28 03:01:45,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:45,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-28 03:01:45,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:45,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-28 03:01:45,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:45,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-28 03:01:45,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:45,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-28 03:01:45,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:45,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-28 03:01:45,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:45,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-28 03:01:45,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:45,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-28 03:01:45,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:45,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-28 03:01:45,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:45,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-28 03:01:45,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:45,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-28 03:01:45,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:45,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-28 03:01:45,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:45,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-28 03:01:45,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:45,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-28 03:01:45,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:45,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-28 03:01:45,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:45,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-28 03:01:45,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:45,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-28 03:01:45,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:45,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-28 03:01:45,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:45,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-28 03:01:45,553 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:45,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-28 03:01:45,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:45,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-28 03:01:45,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:45,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-28 03:01:45,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:45,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-28 03:01:45,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:45,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-28 03:01:45,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:45,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-28 03:01:45,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:45,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-28 03:01:45,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:45,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-28 03:01:45,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:45,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-28 03:01:45,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:45,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-28 03:01:45,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:45,560 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-28 03:01:45,560 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:45,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-28 03:01:45,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:45,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-28 03:01:45,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:45,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-28 03:01:45,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:45,563 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-28 03:01:45,563 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:45,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-28 03:01:45,564 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:45,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-28 03:01:45,565 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:45,565 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-28 03:01:45,565 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:45,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-28 03:01:45,566 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:45,566 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-28 03:01:45,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:45,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-28 03:01:45,567 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:45,568 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-28 03:01:45,568 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:45,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-28 03:01:45,569 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:45,569 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-28 03:01:45,569 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:45,570 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-28 03:01:45,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:45,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-28 03:01:45,571 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:45,571 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-28 03:01:45,571 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:45,572 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-28 03:01:45,572 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:45,572 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-28 03:01:45,573 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:45,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-28 03:01:45,573 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:45,574 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-28 03:01:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:45,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:48,637 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-28 03:01:48,637 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-28 03:01:48,638 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-28 03:01:48,639 INFO L290 TraceCheckUtils]: 116: Hoare triple {89857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-28 03:01:48,639 INFO L290 TraceCheckUtils]: 115: Hoare triple {89861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89857#(< main_~i~0 1024)} is VALID [2022-04-28 03:01:48,640 INFO L290 TraceCheckUtils]: 114: Hoare triple {89861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89861#(< main_~i~0 1023)} is VALID [2022-04-28 03:01:48,640 INFO L290 TraceCheckUtils]: 113: Hoare triple {89868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89861#(< main_~i~0 1023)} is VALID [2022-04-28 03:01:48,640 INFO L290 TraceCheckUtils]: 112: Hoare triple {89868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89868#(< main_~i~0 1022)} is VALID [2022-04-28 03:01:48,640 INFO L290 TraceCheckUtils]: 111: Hoare triple {89875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89868#(< main_~i~0 1022)} is VALID [2022-04-28 03:01:48,641 INFO L290 TraceCheckUtils]: 110: Hoare triple {89875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89875#(< main_~i~0 1021)} is VALID [2022-04-28 03:01:48,641 INFO L290 TraceCheckUtils]: 109: Hoare triple {89882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89875#(< main_~i~0 1021)} is VALID [2022-04-28 03:01:48,641 INFO L290 TraceCheckUtils]: 108: Hoare triple {89882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89882#(< main_~i~0 1020)} is VALID [2022-04-28 03:01:48,641 INFO L290 TraceCheckUtils]: 107: Hoare triple {89889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89882#(< main_~i~0 1020)} is VALID [2022-04-28 03:01:48,642 INFO L290 TraceCheckUtils]: 106: Hoare triple {89889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89889#(< main_~i~0 1019)} is VALID [2022-04-28 03:01:48,642 INFO L290 TraceCheckUtils]: 105: Hoare triple {89896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89889#(< main_~i~0 1019)} is VALID [2022-04-28 03:01:48,642 INFO L290 TraceCheckUtils]: 104: Hoare triple {89896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89896#(< main_~i~0 1018)} is VALID [2022-04-28 03:01:48,642 INFO L290 TraceCheckUtils]: 103: Hoare triple {89903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89896#(< main_~i~0 1018)} is VALID [2022-04-28 03:01:48,642 INFO L290 TraceCheckUtils]: 102: Hoare triple {89903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89903#(< main_~i~0 1017)} is VALID [2022-04-28 03:01:48,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {89910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89903#(< main_~i~0 1017)} is VALID [2022-04-28 03:01:48,644 INFO L290 TraceCheckUtils]: 100: Hoare triple {89910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89910#(< main_~i~0 1016)} is VALID [2022-04-28 03:01:48,644 INFO L290 TraceCheckUtils]: 99: Hoare triple {89917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89910#(< main_~i~0 1016)} is VALID [2022-04-28 03:01:48,645 INFO L290 TraceCheckUtils]: 98: Hoare triple {89917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89917#(< main_~i~0 1015)} is VALID [2022-04-28 03:01:48,654 INFO L290 TraceCheckUtils]: 97: Hoare triple {89924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89917#(< main_~i~0 1015)} is VALID [2022-04-28 03:01:48,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {89924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89924#(< main_~i~0 1014)} is VALID [2022-04-28 03:01:48,655 INFO L290 TraceCheckUtils]: 95: Hoare triple {89931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89924#(< main_~i~0 1014)} is VALID [2022-04-28 03:01:48,655 INFO L290 TraceCheckUtils]: 94: Hoare triple {89931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89931#(< main_~i~0 1013)} is VALID [2022-04-28 03:01:48,655 INFO L290 TraceCheckUtils]: 93: Hoare triple {89938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89931#(< main_~i~0 1013)} is VALID [2022-04-28 03:01:48,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {89938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89938#(< main_~i~0 1012)} is VALID [2022-04-28 03:01:48,656 INFO L290 TraceCheckUtils]: 91: Hoare triple {89945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89938#(< main_~i~0 1012)} is VALID [2022-04-28 03:01:48,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {89945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89945#(< main_~i~0 1011)} is VALID [2022-04-28 03:01:48,656 INFO L290 TraceCheckUtils]: 89: Hoare triple {89952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89945#(< main_~i~0 1011)} is VALID [2022-04-28 03:01:48,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {89952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89952#(< main_~i~0 1010)} is VALID [2022-04-28 03:01:48,657 INFO L290 TraceCheckUtils]: 87: Hoare triple {89959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89952#(< main_~i~0 1010)} is VALID [2022-04-28 03:01:48,657 INFO L290 TraceCheckUtils]: 86: Hoare triple {89959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89959#(< main_~i~0 1009)} is VALID [2022-04-28 03:01:48,657 INFO L290 TraceCheckUtils]: 85: Hoare triple {89966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89959#(< main_~i~0 1009)} is VALID [2022-04-28 03:01:48,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {89966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89966#(< main_~i~0 1008)} is VALID [2022-04-28 03:01:48,658 INFO L290 TraceCheckUtils]: 83: Hoare triple {89973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89966#(< main_~i~0 1008)} is VALID [2022-04-28 03:01:48,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {89973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89973#(< main_~i~0 1007)} is VALID [2022-04-28 03:01:48,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {89980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89973#(< main_~i~0 1007)} is VALID [2022-04-28 03:01:48,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {89980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89980#(< main_~i~0 1006)} is VALID [2022-04-28 03:01:48,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {89987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89980#(< main_~i~0 1006)} is VALID [2022-04-28 03:01:48,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {89987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89987#(< main_~i~0 1005)} is VALID [2022-04-28 03:01:48,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {89994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89987#(< main_~i~0 1005)} is VALID [2022-04-28 03:01:48,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {89994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89994#(< main_~i~0 1004)} is VALID [2022-04-28 03:01:48,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {90001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89994#(< main_~i~0 1004)} is VALID [2022-04-28 03:01:48,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {90001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90001#(< main_~i~0 1003)} is VALID [2022-04-28 03:01:48,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {90008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90001#(< main_~i~0 1003)} is VALID [2022-04-28 03:01:48,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {90008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90008#(< main_~i~0 1002)} is VALID [2022-04-28 03:01:48,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {90015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90008#(< main_~i~0 1002)} is VALID [2022-04-28 03:01:48,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {90015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90015#(< main_~i~0 1001)} is VALID [2022-04-28 03:01:48,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {90022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90015#(< main_~i~0 1001)} is VALID [2022-04-28 03:01:48,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {90022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90022#(< main_~i~0 1000)} is VALID [2022-04-28 03:01:48,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {90029#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90022#(< main_~i~0 1000)} is VALID [2022-04-28 03:01:48,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {90029#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90029#(< main_~i~0 999)} is VALID [2022-04-28 03:01:48,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {90036#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90029#(< main_~i~0 999)} is VALID [2022-04-28 03:01:48,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {90036#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90036#(< main_~i~0 998)} is VALID [2022-04-28 03:01:48,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {90043#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90036#(< main_~i~0 998)} is VALID [2022-04-28 03:01:48,663 INFO L290 TraceCheckUtils]: 62: Hoare triple {90043#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90043#(< main_~i~0 997)} is VALID [2022-04-28 03:01:48,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {90050#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90043#(< main_~i~0 997)} is VALID [2022-04-28 03:01:48,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {90050#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90050#(< main_~i~0 996)} is VALID [2022-04-28 03:01:48,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {90057#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90050#(< main_~i~0 996)} is VALID [2022-04-28 03:01:48,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {90057#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90057#(< main_~i~0 995)} is VALID [2022-04-28 03:01:48,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {90064#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90057#(< main_~i~0 995)} is VALID [2022-04-28 03:01:48,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {90064#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90064#(< main_~i~0 994)} is VALID [2022-04-28 03:01:48,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {90071#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90064#(< main_~i~0 994)} is VALID [2022-04-28 03:01:48,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {90071#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90071#(< main_~i~0 993)} is VALID [2022-04-28 03:01:48,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {90078#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90071#(< main_~i~0 993)} is VALID [2022-04-28 03:01:48,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {90078#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90078#(< main_~i~0 992)} is VALID [2022-04-28 03:01:48,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {90085#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90078#(< main_~i~0 992)} is VALID [2022-04-28 03:01:48,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {90085#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90085#(< main_~i~0 991)} is VALID [2022-04-28 03:01:48,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {90092#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90085#(< main_~i~0 991)} is VALID [2022-04-28 03:01:48,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {90092#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90092#(< main_~i~0 990)} is VALID [2022-04-28 03:01:48,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {90099#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90092#(< main_~i~0 990)} is VALID [2022-04-28 03:01:48,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {90099#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90099#(< main_~i~0 989)} is VALID [2022-04-28 03:01:48,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {90106#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90099#(< main_~i~0 989)} is VALID [2022-04-28 03:01:48,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {90106#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90106#(< main_~i~0 988)} is VALID [2022-04-28 03:01:48,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {90113#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90106#(< main_~i~0 988)} is VALID [2022-04-28 03:01:48,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {90113#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90113#(< main_~i~0 987)} is VALID [2022-04-28 03:01:48,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {90120#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90113#(< main_~i~0 987)} is VALID [2022-04-28 03:01:48,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {90120#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90120#(< main_~i~0 986)} is VALID [2022-04-28 03:01:48,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {90127#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90120#(< main_~i~0 986)} is VALID [2022-04-28 03:01:48,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {90127#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90127#(< main_~i~0 985)} is VALID [2022-04-28 03:01:48,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {90134#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90127#(< main_~i~0 985)} is VALID [2022-04-28 03:01:48,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {90134#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90134#(< main_~i~0 984)} is VALID [2022-04-28 03:01:48,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {90141#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90134#(< main_~i~0 984)} is VALID [2022-04-28 03:01:48,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {90141#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90141#(< main_~i~0 983)} is VALID [2022-04-28 03:01:48,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {90148#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90141#(< main_~i~0 983)} is VALID [2022-04-28 03:01:48,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {90148#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90148#(< main_~i~0 982)} is VALID [2022-04-28 03:01:48,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {90155#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90148#(< main_~i~0 982)} is VALID [2022-04-28 03:01:48,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {90155#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90155#(< main_~i~0 981)} is VALID [2022-04-28 03:01:48,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {90162#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90155#(< main_~i~0 981)} is VALID [2022-04-28 03:01:48,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {90162#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90162#(< main_~i~0 980)} is VALID [2022-04-28 03:01:48,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {90169#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90162#(< main_~i~0 980)} is VALID [2022-04-28 03:01:48,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {90169#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90169#(< main_~i~0 979)} is VALID [2022-04-28 03:01:48,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {90176#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90169#(< main_~i~0 979)} is VALID [2022-04-28 03:01:48,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {90176#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90176#(< main_~i~0 978)} is VALID [2022-04-28 03:01:48,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {90183#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90176#(< main_~i~0 978)} is VALID [2022-04-28 03:01:48,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {90183#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90183#(< main_~i~0 977)} is VALID [2022-04-28 03:01:48,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {90190#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90183#(< main_~i~0 977)} is VALID [2022-04-28 03:01:48,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {90190#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90190#(< main_~i~0 976)} is VALID [2022-04-28 03:01:48,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {90197#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90190#(< main_~i~0 976)} is VALID [2022-04-28 03:01:48,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {90197#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90197#(< main_~i~0 975)} is VALID [2022-04-28 03:01:48,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {90204#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90197#(< main_~i~0 975)} is VALID [2022-04-28 03:01:48,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {90204#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90204#(< main_~i~0 974)} is VALID [2022-04-28 03:01:48,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {90211#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90204#(< main_~i~0 974)} is VALID [2022-04-28 03:01:48,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {90211#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90211#(< main_~i~0 973)} is VALID [2022-04-28 03:01:48,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {90218#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90211#(< main_~i~0 973)} is VALID [2022-04-28 03:01:48,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {90218#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90218#(< main_~i~0 972)} is VALID [2022-04-28 03:01:48,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {90225#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90218#(< main_~i~0 972)} is VALID [2022-04-28 03:01:48,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {90225#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90225#(< main_~i~0 971)} is VALID [2022-04-28 03:01:48,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {90232#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90225#(< main_~i~0 971)} is VALID [2022-04-28 03:01:48,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {90232#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90232#(< main_~i~0 970)} is VALID [2022-04-28 03:01:48,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {90239#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90232#(< main_~i~0 970)} is VALID [2022-04-28 03:01:48,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {90239#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90239#(< main_~i~0 969)} is VALID [2022-04-28 03:01:48,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {90239#(< main_~i~0 969)} is VALID [2022-04-28 03:01:48,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-28 03:01:48,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-28 03:01:48,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-28 03:01:48,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#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(12, 2); {89347#true} is VALID [2022-04-28 03:01:48,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-28 03:01:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:01:48,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574916316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:48,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:48,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-28 03:01:48,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156782009] [2022-04-28 03:01:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156782009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:48,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:48,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:01:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278342986] [2022-04-28 03:01:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 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 133 [2022-04-28 03:01:48,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:48,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:01:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:01:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:01:48,777 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:01,093 INFO L93 Difference]: Finished difference Result 425 states and 541 transitions. [2022-04-28 03:02:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:02:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 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 133 [2022-04-28 03:02:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-28 03:02:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-28 03:02:01,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 532 transitions. [2022-04-28 03:02:01,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:01,486 INFO L225 Difference]: With dead ends: 425 [2022-04-28 03:02:01,487 INFO L226 Difference]: Without dead ends: 408 [2022-04-28 03:02:01,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:02:01,488 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1250 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:01,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 42 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:02:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-28 03:02:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 136. [2022-04-28 03:02:02,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:02,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,157 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,157 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:02,163 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-28 03:02:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-28 03:02:02,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:02,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:02,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-28 03:02:02,163 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-28 03:02:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:02,169 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-28 03:02:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-28 03:02:02,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:02,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:02,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:02,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2022-04-28 03:02:02,171 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 133 [2022-04-28 03:02:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2022-04-28 03:02:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 140 transitions. [2022-04-28 03:02:02,490 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-28 03:02:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2022-04-28 03:02:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 03:02:02,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:02,490 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:02,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 03:02:02,711 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 113 times [2022-04-28 03:02:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032353675] [2022-04-28 03:02:02,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:02,715 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:02:02,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:02:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 114 times [2022-04-28 03:02:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:02,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332492131] [2022-04-28 03:02:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:03,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {92375#(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(12, 2); {92313#true} is VALID [2022-04-28 03:02:03,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-28 03:02:03,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-28 03:02:03,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:03,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {92375#(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(12, 2); {92313#true} is VALID [2022-04-28 03:02:03,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-28 03:02:03,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-28 03:02:03,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-28 03:02:03,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92318#(= main_~i~0 0)} is VALID [2022-04-28 03:02:03,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {92318#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92318#(= main_~i~0 0)} is VALID [2022-04-28 03:02:03,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {92318#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:03,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {92319#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:03,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {92319#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:03,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {92320#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:03,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {92320#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92321#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:03,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {92321#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92321#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:03,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {92321#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92322#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:03,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {92322#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92322#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:03,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {92322#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92323#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:03,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {92323#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92323#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:03,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {92323#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92324#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:03,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {92324#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92324#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:03,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {92324#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92325#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:03,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {92325#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92325#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:03,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {92325#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92326#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:03,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {92326#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92326#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:03,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {92326#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92327#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:03,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {92327#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92327#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:03,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {92327#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92328#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:03,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {92328#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92328#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:03,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {92328#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92329#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:03,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {92329#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92329#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:03,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {92329#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92330#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:03,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {92330#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92330#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:03,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {92330#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92331#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:03,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {92331#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92331#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:03,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {92331#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92332#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:03,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {92332#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92332#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:03,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {92332#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92333#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:03,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {92333#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92333#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:03,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {92333#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92334#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:03,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {92334#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92334#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:03,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {92334#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92335#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:03,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {92335#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92335#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:03,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {92335#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92336#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:03,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {92336#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92336#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:03,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {92336#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92337#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:03,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {92337#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92337#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:03,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {92337#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92338#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:03,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {92338#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92338#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:03,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {92338#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92339#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:03,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {92339#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92339#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:03,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {92339#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92340#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:03,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {92340#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92340#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:03,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {92340#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92341#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:03,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {92341#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92341#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:03,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {92341#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92342#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:03,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {92342#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92342#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:03,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {92342#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92343#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:03,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {92343#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92343#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:03,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {92343#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:03,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92344#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:03,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92345#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:03,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {92345#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92345#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:03,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {92345#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92346#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:03,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {92346#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92346#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:03,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {92346#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92347#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:03,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {92347#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92347#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:03,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {92347#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92348#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:03,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {92348#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92348#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:03,874 INFO L290 TraceCheckUtils]: 67: Hoare triple {92348#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92349#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:03,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {92349#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92349#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:03,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {92349#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92350#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:03,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {92350#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92350#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:03,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {92350#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92351#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:03,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {92351#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92351#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:03,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {92351#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92352#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:03,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {92352#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92352#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:03,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {92352#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92353#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:03,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {92353#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92353#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:03,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {92353#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92354#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:03,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {92354#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92354#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:03,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {92354#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92355#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:03,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {92355#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92355#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:03,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {92355#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92356#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:03,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {92356#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92356#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:03,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {92356#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92357#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:03,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {92357#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92357#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:03,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {92357#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92358#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:03,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {92358#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92358#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:03,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {92358#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92359#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:03,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {92359#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92359#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:03,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {92359#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92360#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:03,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {92360#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92360#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:03,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {92360#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92361#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:03,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {92361#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92361#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:03,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {92361#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92362#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:03,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {92362#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92362#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:03,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {92362#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92363#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:03,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {92363#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92363#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:03,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {92363#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92364#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:03,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {92364#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92364#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:03,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {92364#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92365#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:03,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {92365#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92365#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:03,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {92365#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92366#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:03,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {92366#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92366#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:03,883 INFO L290 TraceCheckUtils]: 103: Hoare triple {92366#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92367#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:03,884 INFO L290 TraceCheckUtils]: 104: Hoare triple {92367#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92367#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:03,884 INFO L290 TraceCheckUtils]: 105: Hoare triple {92367#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92368#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:03,884 INFO L290 TraceCheckUtils]: 106: Hoare triple {92368#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92368#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:03,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {92368#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92369#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:03,885 INFO L290 TraceCheckUtils]: 108: Hoare triple {92369#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92369#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:03,885 INFO L290 TraceCheckUtils]: 109: Hoare triple {92369#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92370#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:03,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {92370#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92370#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:03,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {92370#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92371#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:03,886 INFO L290 TraceCheckUtils]: 112: Hoare triple {92371#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92371#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:03,886 INFO L290 TraceCheckUtils]: 113: Hoare triple {92371#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92372#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:03,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {92372#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92372#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:03,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {92372#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92373#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 116: Hoare triple {92373#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92373#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {92373#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92374#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {92374#(<= main_~i~0 56)} assume !(~i~0 < 1024); {92314#false} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {92314#false} ~i~0 := 0; {92314#false} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-28 03:02:03,887 INFO L290 TraceCheckUtils]: 122: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 123: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 124: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 125: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 126: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 127: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 128: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 129: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 130: Hoare triple {92314#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L272 TraceCheckUtils]: 131: Hoare triple {92314#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 132: Hoare triple {92314#false} ~cond := #in~cond; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 133: Hoare triple {92314#false} assume 0 == ~cond; {92314#false} is VALID [2022-04-28 03:02:03,888 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-28 03:02:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332492131] [2022-04-28 03:02:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332492131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119733763] [2022-04-28 03:02:03,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:03,890 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:03,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 03:02:04,221 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:02:04,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:04,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:02:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:04,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:04,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#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(12, 2); {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,485 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,486 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-28 03:02:04,496 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92736#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:04,496 INFO L290 TraceCheckUtils]: 120: Hoare triple {92736#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {92736#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:04,496 INFO L290 TraceCheckUtils]: 121: Hoare triple {92736#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92736#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:04,497 INFO L290 TraceCheckUtils]: 122: Hoare triple {92736#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92736#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:04,497 INFO L290 TraceCheckUtils]: 123: Hoare triple {92736#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:04,497 INFO L290 TraceCheckUtils]: 124: Hoare triple {92319#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:04,498 INFO L290 TraceCheckUtils]: 125: Hoare triple {92319#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:04,498 INFO L290 TraceCheckUtils]: 126: Hoare triple {92319#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92319#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:04,498 INFO L290 TraceCheckUtils]: 127: Hoare triple {92319#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:04,499 INFO L290 TraceCheckUtils]: 128: Hoare triple {92320#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:04,499 INFO L290 TraceCheckUtils]: 129: Hoare triple {92320#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:04,499 INFO L290 TraceCheckUtils]: 130: Hoare triple {92320#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92320#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:04,500 INFO L272 TraceCheckUtils]: 131: Hoare triple {92320#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:04,500 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:02:04,501 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-28 03:02:04,501 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-28 03:02:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-28 03:02:04,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:04,852 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-28 03:02:04,853 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-28 03:02:04,853 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:02:04,854 INFO L272 TraceCheckUtils]: 131: Hoare triple {92793#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:04,854 INFO L290 TraceCheckUtils]: 130: Hoare triple {92793#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92793#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:04,854 INFO L290 TraceCheckUtils]: 129: Hoare triple {92793#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92793#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:04,854 INFO L290 TraceCheckUtils]: 128: Hoare triple {92793#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {92793#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:04,855 INFO L290 TraceCheckUtils]: 127: Hoare triple {92806#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92793#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:04,855 INFO L290 TraceCheckUtils]: 126: Hoare triple {92806#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92806#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:04,855 INFO L290 TraceCheckUtils]: 125: Hoare triple {92806#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92806#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:04,856 INFO L290 TraceCheckUtils]: 124: Hoare triple {92806#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {92806#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:04,856 INFO L290 TraceCheckUtils]: 123: Hoare triple {92819#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92806#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:04,856 INFO L290 TraceCheckUtils]: 122: Hoare triple {92819#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92819#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 121: Hoare triple {92819#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92819#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 120: Hoare triple {92819#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {92819#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92819#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,857 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,858 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,859 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-28 03:02:04,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#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(12, 2); {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-28 03:02:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-28 03:02:04,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119733763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:04,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:04,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 7] total 66 [2022-04-28 03:02:04,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:04,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032353675] [2022-04-28 03:02:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032353675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:04,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:04,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:02:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371028035] [2022-04-28 03:02:04,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 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 135 [2022-04-28 03:02:04,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:04,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:04,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:04,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:02:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:02:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 03:02:04,938 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:16,964 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-28 03:02:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:02:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 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 135 [2022-04-28 03:02:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-28 03:02:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-28 03:02:16,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 541 transitions. [2022-04-28 03:02:17,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:17,357 INFO L225 Difference]: With dead ends: 432 [2022-04-28 03:02:17,357 INFO L226 Difference]: Without dead ends: 415 [2022-04-28 03:02:17,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5551, Invalid=9455, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 03:02:17,358 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1483 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:17,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:02:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-28 03:02:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 138. [2022-04-28 03:02:17,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:17,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:17,969 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:17,969 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:17,974 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-28 03:02:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-28 03:02:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:17,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:17,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-28 03:02:17,975 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-28 03:02:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:17,980 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-28 03:02:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-28 03:02:17,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:17,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:17,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:17,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2022-04-28 03:02:17,982 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 135 [2022-04-28 03:02:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:17,982 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2022-04-28 03:02:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:17,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 142 transitions. [2022-04-28 03:02:18,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-28 03:02:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 03:02:18,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:18,294 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:18,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:18,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 03:02:18,511 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 115 times [2022-04-28 03:02:18,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:18,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354339298] [2022-04-28 03:02:18,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:18,514 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:02:18,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:02:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 116 times [2022-04-28 03:02:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:18,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779607962] [2022-04-28 03:02:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:19,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {95338#(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(12, 2); {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {95338#(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(12, 2); {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-28 03:02:19,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-28 03:02:19,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95280#(= main_~i~0 0)} is VALID [2022-04-28 03:02:19,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {95280#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95280#(= main_~i~0 0)} is VALID [2022-04-28 03:02:19,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {95280#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:19,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:19,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:19,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:19,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:19,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:19,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:19,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:19,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:19,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:19,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:19,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:19,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:19,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:19,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:19,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:19,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:19,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:19,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:19,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:19,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:19,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:19,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:19,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:19,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:19,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:19,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:19,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:19,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:19,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:19,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:19,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:19,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:19,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:19,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:19,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:19,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:19,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:19,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:19,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:19,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:19,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:19,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:19,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:19,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:19,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:19,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:19,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:19,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:19,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:19,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:19,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:19,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:19,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:19,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:19,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:19,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:19,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:19,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:19,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:19,546 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:19,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:19,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:19,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:19,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:19,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:19,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:19,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:19,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:19,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:19,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:19,549 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:19,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:19,550 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:19,550 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:19,550 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:19,551 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:19,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:19,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:19,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:19,552 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:19,552 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:19,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:19,552 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:19,553 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:19,553 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:19,553 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:19,553 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:19,554 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:19,554 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:19,554 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:19,554 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:19,555 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:19,555 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:19,555 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:19,555 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:19,556 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:19,556 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:19,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:19,556 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:19,557 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:19,557 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:19,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:19,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:19,558 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:19,558 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:19,558 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:19,558 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:19,559 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:19,559 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:19,559 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:19,559 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:19,560 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-28 03:02:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779607962] [2022-04-28 03:02:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779607962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784139372] [2022-04-28 03:02:19,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:19,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:19,563 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:19,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 03:02:19,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:19,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:19,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 03:02:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:19,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:20,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-28 03:02:20,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#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(12, 2); {95275#true} is VALID [2022-04-28 03:02:20,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-28 03:02:20,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-28 03:02:20,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-28 03:02:20,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95357#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:20,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {95357#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95357#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:20,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {95357#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:20,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:20,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:20,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:20,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:20,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:20,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:20,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:20,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:20,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:20,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:20,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:20,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:20,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:20,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:20,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:20,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:20,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:20,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:20,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:20,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:20,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:20,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:20,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:20,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:20,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:20,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:20,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:20,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:20,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:20,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:20,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:20,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:20,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:20,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:20,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:20,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:20,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:20,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:20,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:20,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:20,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:20,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:20,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:20,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:20,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:20,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:20,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:20,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:20,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:20,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:20,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:20,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:20,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:20,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:20,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:20,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:20,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:20,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:20,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:20,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:20,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:20,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:20,446 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:20,446 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:20,446 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:20,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:20,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:20,447 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:20,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:20,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:20,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:20,448 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:20,448 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:20,448 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:20,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:20,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:20,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:20,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:20,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:20,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:20,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:20,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:20,450 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:20,450 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:20,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:20,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:20,451 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:20,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:20,451 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:20,452 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:20,452 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:20,452 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:20,452 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:20,452 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:20,453 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:20,453 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:20,453 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:20,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:20,454 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:20,454 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:20,454 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:20,454 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:20,454 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:20,455 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:20,455 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:20,455 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:20,455 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:20,456 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:20,456 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:20,456 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:20,456 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:20,456 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-28 03:02:20,457 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-28 03:02:20,458 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-28 03:02:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:20,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:23,320 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 120: Hoare triple {95799#(< main_~i~0 1024)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 119: Hoare triple {95803#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95799#(< main_~i~0 1024)} is VALID [2022-04-28 03:02:23,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {95803#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95803#(< main_~i~0 1023)} is VALID [2022-04-28 03:02:23,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {95810#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95803#(< main_~i~0 1023)} is VALID [2022-04-28 03:02:23,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {95810#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95810#(< main_~i~0 1022)} is VALID [2022-04-28 03:02:23,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {95817#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95810#(< main_~i~0 1022)} is VALID [2022-04-28 03:02:23,322 INFO L290 TraceCheckUtils]: 114: Hoare triple {95817#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95817#(< main_~i~0 1021)} is VALID [2022-04-28 03:02:23,323 INFO L290 TraceCheckUtils]: 113: Hoare triple {95824#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95817#(< main_~i~0 1021)} is VALID [2022-04-28 03:02:23,323 INFO L290 TraceCheckUtils]: 112: Hoare triple {95824#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95824#(< main_~i~0 1020)} is VALID [2022-04-28 03:02:23,323 INFO L290 TraceCheckUtils]: 111: Hoare triple {95831#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95824#(< main_~i~0 1020)} is VALID [2022-04-28 03:02:23,323 INFO L290 TraceCheckUtils]: 110: Hoare triple {95831#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95831#(< main_~i~0 1019)} is VALID [2022-04-28 03:02:23,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {95838#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95831#(< main_~i~0 1019)} is VALID [2022-04-28 03:02:23,324 INFO L290 TraceCheckUtils]: 108: Hoare triple {95838#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95838#(< main_~i~0 1018)} is VALID [2022-04-28 03:02:23,324 INFO L290 TraceCheckUtils]: 107: Hoare triple {95845#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95838#(< main_~i~0 1018)} is VALID [2022-04-28 03:02:23,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {95845#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95845#(< main_~i~0 1017)} is VALID [2022-04-28 03:02:23,324 INFO L290 TraceCheckUtils]: 105: Hoare triple {95852#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95845#(< main_~i~0 1017)} is VALID [2022-04-28 03:02:23,325 INFO L290 TraceCheckUtils]: 104: Hoare triple {95852#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95852#(< main_~i~0 1016)} is VALID [2022-04-28 03:02:23,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {95859#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95852#(< main_~i~0 1016)} is VALID [2022-04-28 03:02:23,325 INFO L290 TraceCheckUtils]: 102: Hoare triple {95859#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95859#(< main_~i~0 1015)} is VALID [2022-04-28 03:02:23,325 INFO L290 TraceCheckUtils]: 101: Hoare triple {95866#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95859#(< main_~i~0 1015)} is VALID [2022-04-28 03:02:23,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {95866#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95866#(< main_~i~0 1014)} is VALID [2022-04-28 03:02:23,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {95873#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95866#(< main_~i~0 1014)} is VALID [2022-04-28 03:02:23,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {95873#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95873#(< main_~i~0 1013)} is VALID [2022-04-28 03:02:23,326 INFO L290 TraceCheckUtils]: 97: Hoare triple {95880#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95873#(< main_~i~0 1013)} is VALID [2022-04-28 03:02:23,326 INFO L290 TraceCheckUtils]: 96: Hoare triple {95880#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95880#(< main_~i~0 1012)} is VALID [2022-04-28 03:02:23,327 INFO L290 TraceCheckUtils]: 95: Hoare triple {95887#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95880#(< main_~i~0 1012)} is VALID [2022-04-28 03:02:23,327 INFO L290 TraceCheckUtils]: 94: Hoare triple {95887#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95887#(< main_~i~0 1011)} is VALID [2022-04-28 03:02:23,327 INFO L290 TraceCheckUtils]: 93: Hoare triple {95894#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95887#(< main_~i~0 1011)} is VALID [2022-04-28 03:02:23,327 INFO L290 TraceCheckUtils]: 92: Hoare triple {95894#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95894#(< main_~i~0 1010)} is VALID [2022-04-28 03:02:23,328 INFO L290 TraceCheckUtils]: 91: Hoare triple {95901#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95894#(< main_~i~0 1010)} is VALID [2022-04-28 03:02:23,328 INFO L290 TraceCheckUtils]: 90: Hoare triple {95901#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95901#(< main_~i~0 1009)} is VALID [2022-04-28 03:02:23,328 INFO L290 TraceCheckUtils]: 89: Hoare triple {95908#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95901#(< main_~i~0 1009)} is VALID [2022-04-28 03:02:23,328 INFO L290 TraceCheckUtils]: 88: Hoare triple {95908#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95908#(< main_~i~0 1008)} is VALID [2022-04-28 03:02:23,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {95915#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95908#(< main_~i~0 1008)} is VALID [2022-04-28 03:02:23,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {95915#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95915#(< main_~i~0 1007)} is VALID [2022-04-28 03:02:23,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {95922#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95915#(< main_~i~0 1007)} is VALID [2022-04-28 03:02:23,329 INFO L290 TraceCheckUtils]: 84: Hoare triple {95922#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95922#(< main_~i~0 1006)} is VALID [2022-04-28 03:02:23,329 INFO L290 TraceCheckUtils]: 83: Hoare triple {95929#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95922#(< main_~i~0 1006)} is VALID [2022-04-28 03:02:23,330 INFO L290 TraceCheckUtils]: 82: Hoare triple {95929#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95929#(< main_~i~0 1005)} is VALID [2022-04-28 03:02:23,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {95936#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95929#(< main_~i~0 1005)} is VALID [2022-04-28 03:02:23,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {95936#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95936#(< main_~i~0 1004)} is VALID [2022-04-28 03:02:23,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {95943#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95936#(< main_~i~0 1004)} is VALID [2022-04-28 03:02:23,330 INFO L290 TraceCheckUtils]: 78: Hoare triple {95943#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95943#(< main_~i~0 1003)} is VALID [2022-04-28 03:02:23,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {95950#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95943#(< main_~i~0 1003)} is VALID [2022-04-28 03:02:23,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {95950#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95950#(< main_~i~0 1002)} is VALID [2022-04-28 03:02:23,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {95957#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95950#(< main_~i~0 1002)} is VALID [2022-04-28 03:02:23,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {95957#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95957#(< main_~i~0 1001)} is VALID [2022-04-28 03:02:23,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {95964#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95957#(< main_~i~0 1001)} is VALID [2022-04-28 03:02:23,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {95964#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95964#(< main_~i~0 1000)} is VALID [2022-04-28 03:02:23,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {95971#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95964#(< main_~i~0 1000)} is VALID [2022-04-28 03:02:23,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {95971#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95971#(< main_~i~0 999)} is VALID [2022-04-28 03:02:23,333 INFO L290 TraceCheckUtils]: 69: Hoare triple {95978#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95971#(< main_~i~0 999)} is VALID [2022-04-28 03:02:23,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {95978#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95978#(< main_~i~0 998)} is VALID [2022-04-28 03:02:23,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {95985#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95978#(< main_~i~0 998)} is VALID [2022-04-28 03:02:23,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {95985#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95985#(< main_~i~0 997)} is VALID [2022-04-28 03:02:23,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {95992#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95985#(< main_~i~0 997)} is VALID [2022-04-28 03:02:23,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {95992#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95992#(< main_~i~0 996)} is VALID [2022-04-28 03:02:23,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {95999#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95992#(< main_~i~0 996)} is VALID [2022-04-28 03:02:23,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {95999#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95999#(< main_~i~0 995)} is VALID [2022-04-28 03:02:23,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {96006#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95999#(< main_~i~0 995)} is VALID [2022-04-28 03:02:23,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {96006#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96006#(< main_~i~0 994)} is VALID [2022-04-28 03:02:23,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {96013#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96006#(< main_~i~0 994)} is VALID [2022-04-28 03:02:23,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {96013#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96013#(< main_~i~0 993)} is VALID [2022-04-28 03:02:23,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {96020#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96013#(< main_~i~0 993)} is VALID [2022-04-28 03:02:23,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {96020#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96020#(< main_~i~0 992)} is VALID [2022-04-28 03:02:23,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {96027#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96020#(< main_~i~0 992)} is VALID [2022-04-28 03:02:23,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {96027#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96027#(< main_~i~0 991)} is VALID [2022-04-28 03:02:23,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {96034#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96027#(< main_~i~0 991)} is VALID [2022-04-28 03:02:23,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {96034#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96034#(< main_~i~0 990)} is VALID [2022-04-28 03:02:23,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {96041#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96034#(< main_~i~0 990)} is VALID [2022-04-28 03:02:23,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {96041#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96041#(< main_~i~0 989)} is VALID [2022-04-28 03:02:23,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {96048#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96041#(< main_~i~0 989)} is VALID [2022-04-28 03:02:23,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {96048#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96048#(< main_~i~0 988)} is VALID [2022-04-28 03:02:23,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {96055#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96048#(< main_~i~0 988)} is VALID [2022-04-28 03:02:23,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {96055#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96055#(< main_~i~0 987)} is VALID [2022-04-28 03:02:23,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {96062#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96055#(< main_~i~0 987)} is VALID [2022-04-28 03:02:23,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {96062#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96062#(< main_~i~0 986)} is VALID [2022-04-28 03:02:23,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {96069#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96062#(< main_~i~0 986)} is VALID [2022-04-28 03:02:23,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {96069#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96069#(< main_~i~0 985)} is VALID [2022-04-28 03:02:23,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {96076#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96069#(< main_~i~0 985)} is VALID [2022-04-28 03:02:23,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {96076#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96076#(< main_~i~0 984)} is VALID [2022-04-28 03:02:23,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {96083#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96076#(< main_~i~0 984)} is VALID [2022-04-28 03:02:23,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {96083#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96083#(< main_~i~0 983)} is VALID [2022-04-28 03:02:23,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {96090#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96083#(< main_~i~0 983)} is VALID [2022-04-28 03:02:23,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {96090#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96090#(< main_~i~0 982)} is VALID [2022-04-28 03:02:23,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {96097#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96090#(< main_~i~0 982)} is VALID [2022-04-28 03:02:23,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {96097#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96097#(< main_~i~0 981)} is VALID [2022-04-28 03:02:23,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {96104#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96097#(< main_~i~0 981)} is VALID [2022-04-28 03:02:23,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {96104#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96104#(< main_~i~0 980)} is VALID [2022-04-28 03:02:23,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {96111#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96104#(< main_~i~0 980)} is VALID [2022-04-28 03:02:23,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {96111#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96111#(< main_~i~0 979)} is VALID [2022-04-28 03:02:23,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {96118#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96111#(< main_~i~0 979)} is VALID [2022-04-28 03:02:23,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {96118#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96118#(< main_~i~0 978)} is VALID [2022-04-28 03:02:23,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {96125#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96118#(< main_~i~0 978)} is VALID [2022-04-28 03:02:23,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {96125#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96125#(< main_~i~0 977)} is VALID [2022-04-28 03:02:23,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {96132#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96125#(< main_~i~0 977)} is VALID [2022-04-28 03:02:23,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {96132#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96132#(< main_~i~0 976)} is VALID [2022-04-28 03:02:23,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {96139#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96132#(< main_~i~0 976)} is VALID [2022-04-28 03:02:23,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {96139#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96139#(< main_~i~0 975)} is VALID [2022-04-28 03:02:23,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {96146#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96139#(< main_~i~0 975)} is VALID [2022-04-28 03:02:23,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {96146#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96146#(< main_~i~0 974)} is VALID [2022-04-28 03:02:23,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {96153#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96146#(< main_~i~0 974)} is VALID [2022-04-28 03:02:23,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {96153#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96153#(< main_~i~0 973)} is VALID [2022-04-28 03:02:23,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {96160#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96153#(< main_~i~0 973)} is VALID [2022-04-28 03:02:23,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {96160#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96160#(< main_~i~0 972)} is VALID [2022-04-28 03:02:23,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {96167#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96160#(< main_~i~0 972)} is VALID [2022-04-28 03:02:23,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {96167#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96167#(< main_~i~0 971)} is VALID [2022-04-28 03:02:23,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {96174#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96167#(< main_~i~0 971)} is VALID [2022-04-28 03:02:23,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {96174#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96174#(< main_~i~0 970)} is VALID [2022-04-28 03:02:23,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {96181#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96174#(< main_~i~0 970)} is VALID [2022-04-28 03:02:23,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {96181#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96181#(< main_~i~0 969)} is VALID [2022-04-28 03:02:23,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {96188#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96181#(< main_~i~0 969)} is VALID [2022-04-28 03:02:23,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {96188#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96188#(< main_~i~0 968)} is VALID [2022-04-28 03:02:23,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {96195#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96188#(< main_~i~0 968)} is VALID [2022-04-28 03:02:23,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {96195#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96195#(< main_~i~0 967)} is VALID [2022-04-28 03:02:23,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {96195#(< main_~i~0 967)} is VALID [2022-04-28 03:02:23,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-28 03:02:23,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-28 03:02:23,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-28 03:02:23,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#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(12, 2); {95275#true} is VALID [2022-04-28 03:02:23,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-28 03:02:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784139372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:23,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:23,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-28 03:02:23,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:23,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354339298] [2022-04-28 03:02:23,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354339298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:23,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:23,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:02:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149547169] [2022-04-28 03:02:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 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 137 [2022-04-28 03:02:23,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:23,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:23,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:23,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:02:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:02:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 03:02:23,403 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:35,686 INFO L93 Difference]: Finished difference Result 439 states and 559 transitions. [2022-04-28 03:02:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:02:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 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 137 [2022-04-28 03:02:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-28 03:02:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-28 03:02:35,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 550 transitions. [2022-04-28 03:02:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:36,027 INFO L225 Difference]: With dead ends: 439 [2022-04-28 03:02:36,027 INFO L226 Difference]: Without dead ends: 422 [2022-04-28 03:02:36,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 03:02:36,029 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1280 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:36,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 47 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:02:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-28 03:02:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 140. [2022-04-28 03:02:36,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:36,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:36,906 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:36,906 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:36,912 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-28 03:02:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-28 03:02:36,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:36,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:36,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 03:02:36,912 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 03:02:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:36,921 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-28 03:02:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-28 03:02:36,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:36,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:36,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:36,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-28 03:02:36,923 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 137 [2022-04-28 03:02:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:36,924 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-28 03:02:36,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:36,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-28 03:02:37,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-28 03:02:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 03:02:37,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:37,274 INFO L195 NwaCegarLoop]: trace histogram [58, 58, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:37,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-28 03:02:37,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:37,480 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 117 times [2022-04-28 03:02:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:37,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825378348] [2022-04-28 03:02:37,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:37,486 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:02:37,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:02:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 118 times [2022-04-28 03:02:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:37,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068640743] [2022-04-28 03:02:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:38,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {98401#(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(12, 2); {98337#true} is VALID [2022-04-28 03:02:38,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-28 03:02:38,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-28 03:02:38,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:38,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {98401#(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(12, 2); {98337#true} is VALID [2022-04-28 03:02:38,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-28 03:02:38,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-28 03:02:38,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-28 03:02:38,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98342#(= main_~i~0 0)} is VALID [2022-04-28 03:02:38,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {98342#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98342#(= main_~i~0 0)} is VALID [2022-04-28 03:02:38,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {98342#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:38,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:38,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:38,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:38,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:38,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:38,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:38,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:38,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:38,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:38,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:38,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:38,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:38,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:38,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:38,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:38,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:38,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:38,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:38,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:38,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:38,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:38,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:38,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:38,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:38,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:38,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:38,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:38,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:38,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:38,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:38,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:38,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:38,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:38,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:38,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:38,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:38,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:38,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:38,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:38,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:38,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:38,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:38,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:38,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:38,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:38,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:38,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:38,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:38,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:38,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:38,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:38,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:38,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:38,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:38,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:38,711 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:38,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:38,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:38,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:38,712 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:38,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:38,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:38,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:38,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:38,713 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:38,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:38,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:38,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:38,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:38,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:38,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:38,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:38,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:38,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:38,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:38,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:38,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:38,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:38,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:38,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:38,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:38,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:38,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:38,717 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:38,717 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:38,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:38,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:38,718 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:38,718 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:38,718 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:38,719 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:38,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:38,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:38,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:38,719 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:38,720 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:38,720 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:38,720 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:38,720 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:38,721 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:38,721 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:38,721 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:38,721 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:38,722 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:38,722 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:38,722 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:38,722 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:38,722 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:38,723 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:38,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:38,723 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:38,723 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:38,724 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-28 03:02:38,725 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-28 03:02:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:38,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068640743] [2022-04-28 03:02:38,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068640743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:38,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503272482] [2022-04-28 03:02:38,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:38,728 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:38,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 03:02:39,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:39,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:39,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 03:02:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:39,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:39,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-28 03:02:39,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#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(12, 2); {98337#true} is VALID [2022-04-28 03:02:39,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-28 03:02:39,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-28 03:02:39,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-28 03:02:39,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98420#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:39,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {98420#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98420#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:39,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {98420#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:39,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:39,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:39,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:39,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:39,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:39,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:39,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:39,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:39,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:39,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:39,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:39,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:39,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:39,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:39,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:39,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:39,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:39,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:39,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:39,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:39,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:39,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:39,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:39,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:39,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:39,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:39,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:39,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:39,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:39,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:39,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:39,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:39,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:39,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:39,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:39,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:39,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:39,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:39,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:39,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:39,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:39,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:39,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:39,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:39,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:39,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:39,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:39,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:39,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:39,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:39,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:39,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:39,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:39,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:39,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:39,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:39,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:39,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:39,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:39,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:39,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:39,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:39,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:39,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:39,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:39,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:39,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:39,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:39,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:39,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:39,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:39,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:39,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:39,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:39,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:39,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:39,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:39,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:39,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:39,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:39,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:39,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:39,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:39,601 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:39,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:39,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:39,602 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:39,602 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:39,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:39,602 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:39,602 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:39,603 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:39,603 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:39,603 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:39,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:39,604 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:39,604 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:39,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:39,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:39,605 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:39,605 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:39,605 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:39,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:39,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:39,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:39,619 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:39,620 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:39,620 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:39,620 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:39,620 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:39,621 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:39,621 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:39,621 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:39,621 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:39,622 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-28 03:02:39,623 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-28 03:02:39,623 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-28 03:02:39,623 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-28 03:02:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:39,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:42,237 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-28 03:02:42,238 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-28 03:02:42,239 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-28 03:02:42,239 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-28 03:02:42,239 INFO L290 TraceCheckUtils]: 122: Hoare triple {98868#(< main_~i~0 1024)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-28 03:02:42,239 INFO L290 TraceCheckUtils]: 121: Hoare triple {98872#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98868#(< main_~i~0 1024)} is VALID [2022-04-28 03:02:42,239 INFO L290 TraceCheckUtils]: 120: Hoare triple {98872#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98872#(< main_~i~0 1023)} is VALID [2022-04-28 03:02:42,240 INFO L290 TraceCheckUtils]: 119: Hoare triple {98879#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98872#(< main_~i~0 1023)} is VALID [2022-04-28 03:02:42,240 INFO L290 TraceCheckUtils]: 118: Hoare triple {98879#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98879#(< main_~i~0 1022)} is VALID [2022-04-28 03:02:42,240 INFO L290 TraceCheckUtils]: 117: Hoare triple {98886#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98879#(< main_~i~0 1022)} is VALID [2022-04-28 03:02:42,240 INFO L290 TraceCheckUtils]: 116: Hoare triple {98886#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98886#(< main_~i~0 1021)} is VALID [2022-04-28 03:02:42,241 INFO L290 TraceCheckUtils]: 115: Hoare triple {98893#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98886#(< main_~i~0 1021)} is VALID [2022-04-28 03:02:42,241 INFO L290 TraceCheckUtils]: 114: Hoare triple {98893#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98893#(< main_~i~0 1020)} is VALID [2022-04-28 03:02:42,241 INFO L290 TraceCheckUtils]: 113: Hoare triple {98900#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98893#(< main_~i~0 1020)} is VALID [2022-04-28 03:02:42,241 INFO L290 TraceCheckUtils]: 112: Hoare triple {98900#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98900#(< main_~i~0 1019)} is VALID [2022-04-28 03:02:42,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {98907#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98900#(< main_~i~0 1019)} is VALID [2022-04-28 03:02:42,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {98907#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98907#(< main_~i~0 1018)} is VALID [2022-04-28 03:02:42,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {98914#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98907#(< main_~i~0 1018)} is VALID [2022-04-28 03:02:42,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {98914#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98914#(< main_~i~0 1017)} is VALID [2022-04-28 03:02:42,242 INFO L290 TraceCheckUtils]: 107: Hoare triple {98921#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98914#(< main_~i~0 1017)} is VALID [2022-04-28 03:02:42,243 INFO L290 TraceCheckUtils]: 106: Hoare triple {98921#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98921#(< main_~i~0 1016)} is VALID [2022-04-28 03:02:42,243 INFO L290 TraceCheckUtils]: 105: Hoare triple {98928#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98921#(< main_~i~0 1016)} is VALID [2022-04-28 03:02:42,243 INFO L290 TraceCheckUtils]: 104: Hoare triple {98928#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98928#(< main_~i~0 1015)} is VALID [2022-04-28 03:02:42,243 INFO L290 TraceCheckUtils]: 103: Hoare triple {98935#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98928#(< main_~i~0 1015)} is VALID [2022-04-28 03:02:42,244 INFO L290 TraceCheckUtils]: 102: Hoare triple {98935#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98935#(< main_~i~0 1014)} is VALID [2022-04-28 03:02:42,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {98942#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98935#(< main_~i~0 1014)} is VALID [2022-04-28 03:02:42,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {98942#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98942#(< main_~i~0 1013)} is VALID [2022-04-28 03:02:42,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {98949#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98942#(< main_~i~0 1013)} is VALID [2022-04-28 03:02:42,244 INFO L290 TraceCheckUtils]: 98: Hoare triple {98949#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98949#(< main_~i~0 1012)} is VALID [2022-04-28 03:02:42,245 INFO L290 TraceCheckUtils]: 97: Hoare triple {98956#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98949#(< main_~i~0 1012)} is VALID [2022-04-28 03:02:42,245 INFO L290 TraceCheckUtils]: 96: Hoare triple {98956#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98956#(< main_~i~0 1011)} is VALID [2022-04-28 03:02:42,245 INFO L290 TraceCheckUtils]: 95: Hoare triple {98963#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98956#(< main_~i~0 1011)} is VALID [2022-04-28 03:02:42,245 INFO L290 TraceCheckUtils]: 94: Hoare triple {98963#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98963#(< main_~i~0 1010)} is VALID [2022-04-28 03:02:42,246 INFO L290 TraceCheckUtils]: 93: Hoare triple {98970#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98963#(< main_~i~0 1010)} is VALID [2022-04-28 03:02:42,246 INFO L290 TraceCheckUtils]: 92: Hoare triple {98970#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98970#(< main_~i~0 1009)} is VALID [2022-04-28 03:02:42,246 INFO L290 TraceCheckUtils]: 91: Hoare triple {98977#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98970#(< main_~i~0 1009)} is VALID [2022-04-28 03:02:42,246 INFO L290 TraceCheckUtils]: 90: Hoare triple {98977#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98977#(< main_~i~0 1008)} is VALID [2022-04-28 03:02:42,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {98984#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98977#(< main_~i~0 1008)} is VALID [2022-04-28 03:02:42,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {98984#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98984#(< main_~i~0 1007)} is VALID [2022-04-28 03:02:42,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {98991#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98984#(< main_~i~0 1007)} is VALID [2022-04-28 03:02:42,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {98991#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98991#(< main_~i~0 1006)} is VALID [2022-04-28 03:02:42,247 INFO L290 TraceCheckUtils]: 85: Hoare triple {98998#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98991#(< main_~i~0 1006)} is VALID [2022-04-28 03:02:42,248 INFO L290 TraceCheckUtils]: 84: Hoare triple {98998#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98998#(< main_~i~0 1005)} is VALID [2022-04-28 03:02:42,248 INFO L290 TraceCheckUtils]: 83: Hoare triple {99005#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98998#(< main_~i~0 1005)} is VALID [2022-04-28 03:02:42,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {99005#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99005#(< main_~i~0 1004)} is VALID [2022-04-28 03:02:42,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {99012#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99005#(< main_~i~0 1004)} is VALID [2022-04-28 03:02:42,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {99012#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99012#(< main_~i~0 1003)} is VALID [2022-04-28 03:02:42,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {99019#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99012#(< main_~i~0 1003)} is VALID [2022-04-28 03:02:42,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {99019#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99019#(< main_~i~0 1002)} is VALID [2022-04-28 03:02:42,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {99026#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99019#(< main_~i~0 1002)} is VALID [2022-04-28 03:02:42,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {99026#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99026#(< main_~i~0 1001)} is VALID [2022-04-28 03:02:42,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {99033#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99026#(< main_~i~0 1001)} is VALID [2022-04-28 03:02:42,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {99033#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99033#(< main_~i~0 1000)} is VALID [2022-04-28 03:02:42,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {99040#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99033#(< main_~i~0 1000)} is VALID [2022-04-28 03:02:42,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {99040#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99040#(< main_~i~0 999)} is VALID [2022-04-28 03:02:42,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {99047#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99040#(< main_~i~0 999)} is VALID [2022-04-28 03:02:42,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {99047#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99047#(< main_~i~0 998)} is VALID [2022-04-28 03:02:42,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {99054#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99047#(< main_~i~0 998)} is VALID [2022-04-28 03:02:42,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {99054#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99054#(< main_~i~0 997)} is VALID [2022-04-28 03:02:42,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {99061#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99054#(< main_~i~0 997)} is VALID [2022-04-28 03:02:42,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {99061#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99061#(< main_~i~0 996)} is VALID [2022-04-28 03:02:42,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {99068#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99061#(< main_~i~0 996)} is VALID [2022-04-28 03:02:42,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {99068#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99068#(< main_~i~0 995)} is VALID [2022-04-28 03:02:42,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {99075#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99068#(< main_~i~0 995)} is VALID [2022-04-28 03:02:42,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {99075#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99075#(< main_~i~0 994)} is VALID [2022-04-28 03:02:42,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {99082#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99075#(< main_~i~0 994)} is VALID [2022-04-28 03:02:42,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {99082#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99082#(< main_~i~0 993)} is VALID [2022-04-28 03:02:42,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {99089#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99082#(< main_~i~0 993)} is VALID [2022-04-28 03:02:42,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {99089#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99089#(< main_~i~0 992)} is VALID [2022-04-28 03:02:42,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {99096#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99089#(< main_~i~0 992)} is VALID [2022-04-28 03:02:42,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {99096#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99096#(< main_~i~0 991)} is VALID [2022-04-28 03:02:42,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {99103#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99096#(< main_~i~0 991)} is VALID [2022-04-28 03:02:42,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {99103#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99103#(< main_~i~0 990)} is VALID [2022-04-28 03:02:42,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {99110#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99103#(< main_~i~0 990)} is VALID [2022-04-28 03:02:42,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {99110#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99110#(< main_~i~0 989)} is VALID [2022-04-28 03:02:42,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {99117#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99110#(< main_~i~0 989)} is VALID [2022-04-28 03:02:42,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {99117#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99117#(< main_~i~0 988)} is VALID [2022-04-28 03:02:42,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {99124#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99117#(< main_~i~0 988)} is VALID [2022-04-28 03:02:42,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {99124#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99124#(< main_~i~0 987)} is VALID [2022-04-28 03:02:42,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {99131#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99124#(< main_~i~0 987)} is VALID [2022-04-28 03:02:42,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {99131#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99131#(< main_~i~0 986)} is VALID [2022-04-28 03:02:42,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {99138#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99131#(< main_~i~0 986)} is VALID [2022-04-28 03:02:42,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {99138#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99138#(< main_~i~0 985)} is VALID [2022-04-28 03:02:42,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {99145#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99138#(< main_~i~0 985)} is VALID [2022-04-28 03:02:42,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {99145#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99145#(< main_~i~0 984)} is VALID [2022-04-28 03:02:42,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {99152#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99145#(< main_~i~0 984)} is VALID [2022-04-28 03:02:42,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {99152#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99152#(< main_~i~0 983)} is VALID [2022-04-28 03:02:42,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {99159#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99152#(< main_~i~0 983)} is VALID [2022-04-28 03:02:42,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {99159#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99159#(< main_~i~0 982)} is VALID [2022-04-28 03:02:42,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {99166#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99159#(< main_~i~0 982)} is VALID [2022-04-28 03:02:42,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {99166#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99166#(< main_~i~0 981)} is VALID [2022-04-28 03:02:42,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {99173#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99166#(< main_~i~0 981)} is VALID [2022-04-28 03:02:42,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {99173#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99173#(< main_~i~0 980)} is VALID [2022-04-28 03:02:42,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {99180#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99173#(< main_~i~0 980)} is VALID [2022-04-28 03:02:42,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {99180#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99180#(< main_~i~0 979)} is VALID [2022-04-28 03:02:42,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {99187#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99180#(< main_~i~0 979)} is VALID [2022-04-28 03:02:42,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {99187#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99187#(< main_~i~0 978)} is VALID [2022-04-28 03:02:42,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {99194#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99187#(< main_~i~0 978)} is VALID [2022-04-28 03:02:42,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {99194#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99194#(< main_~i~0 977)} is VALID [2022-04-28 03:02:42,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {99201#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99194#(< main_~i~0 977)} is VALID [2022-04-28 03:02:42,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {99201#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99201#(< main_~i~0 976)} is VALID [2022-04-28 03:02:42,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {99208#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99201#(< main_~i~0 976)} is VALID [2022-04-28 03:02:42,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {99208#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99208#(< main_~i~0 975)} is VALID [2022-04-28 03:02:42,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {99215#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99208#(< main_~i~0 975)} is VALID [2022-04-28 03:02:42,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {99215#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99215#(< main_~i~0 974)} is VALID [2022-04-28 03:02:42,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {99222#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99215#(< main_~i~0 974)} is VALID [2022-04-28 03:02:42,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {99222#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99222#(< main_~i~0 973)} is VALID [2022-04-28 03:02:42,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {99229#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99222#(< main_~i~0 973)} is VALID [2022-04-28 03:02:42,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {99229#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99229#(< main_~i~0 972)} is VALID [2022-04-28 03:02:42,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {99236#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99229#(< main_~i~0 972)} is VALID [2022-04-28 03:02:42,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {99236#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99236#(< main_~i~0 971)} is VALID [2022-04-28 03:02:42,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {99243#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99236#(< main_~i~0 971)} is VALID [2022-04-28 03:02:42,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {99243#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99243#(< main_~i~0 970)} is VALID [2022-04-28 03:02:42,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {99250#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99243#(< main_~i~0 970)} is VALID [2022-04-28 03:02:42,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {99250#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99250#(< main_~i~0 969)} is VALID [2022-04-28 03:02:42,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {99257#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99250#(< main_~i~0 969)} is VALID [2022-04-28 03:02:42,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {99257#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99257#(< main_~i~0 968)} is VALID [2022-04-28 03:02:42,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {99264#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99257#(< main_~i~0 968)} is VALID [2022-04-28 03:02:42,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {99264#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99264#(< main_~i~0 967)} is VALID [2022-04-28 03:02:42,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {99271#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99264#(< main_~i~0 967)} is VALID [2022-04-28 03:02:42,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {99271#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99271#(< main_~i~0 966)} is VALID [2022-04-28 03:02:42,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {99271#(< main_~i~0 966)} is VALID [2022-04-28 03:02:42,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-28 03:02:42,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-28 03:02:42,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-28 03:02:42,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#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(12, 2); {98337#true} is VALID [2022-04-28 03:02:42,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-28 03:02:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:42,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503272482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:42,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:42,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-28 03:02:42,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:42,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825378348] [2022-04-28 03:02:42,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825378348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:42,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:42,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:02:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252047779] [2022-04-28 03:02:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:42,278 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 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 139 [2022-04-28 03:02:42,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:42,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:42,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:42,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:02:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:02:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:02:42,343 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:55,345 INFO L93 Difference]: Finished difference Result 446 states and 568 transitions. [2022-04-28 03:02:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 03:02:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 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 139 [2022-04-28 03:02:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-28 03:02:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-28 03:02:55,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 559 transitions. [2022-04-28 03:02:55,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:55,754 INFO L225 Difference]: With dead ends: 446 [2022-04-28 03:02:55,754 INFO L226 Difference]: Without dead ends: 429 [2022-04-28 03:02:55,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:02:55,755 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1398 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:55,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:02:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-28 03:02:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 142. [2022-04-28 03:02:56,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:56,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,544 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,544 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:56,550 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-28 03:02:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-28 03:02:56,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:56,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:56,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-28 03:02:56,551 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-28 03:02:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:56,557 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-28 03:02:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-28 03:02:56,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:56,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:56,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:56,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2022-04-28 03:02:56,559 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 139 [2022-04-28 03:02:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:56,559 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2022-04-28 03:02:56,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 146 transitions. [2022-04-28 03:02:56,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-28 03:02:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 03:02:56,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:56,904 INFO L195 NwaCegarLoop]: trace histogram [59, 59, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:56,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:57,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:57,122 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 119 times [2022-04-28 03:02:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:57,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726928391] [2022-04-28 03:02:57,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:57,125 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:02:57,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:02:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 120 times [2022-04-28 03:02:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:57,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115122619] [2022-04-28 03:02:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {101512#(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(12, 2); {101447#true} is VALID [2022-04-28 03:02:58,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-28 03:02:58,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-28 03:02:58,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:58,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {101512#(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(12, 2); {101447#true} is VALID [2022-04-28 03:02:58,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-28 03:02:58,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-28 03:02:58,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-28 03:02:58,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101452#(= main_~i~0 0)} is VALID [2022-04-28 03:02:58,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {101452#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101452#(= main_~i~0 0)} is VALID [2022-04-28 03:02:58,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {101452#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {101453#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {101453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {101454#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {101454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101455#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:58,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {101455#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101455#(<= main_~i~0 3)} is VALID [2022-04-28 03:02:58,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {101455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101456#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:58,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {101456#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101456#(<= main_~i~0 4)} is VALID [2022-04-28 03:02:58,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {101456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101457#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:58,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {101457#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101457#(<= main_~i~0 5)} is VALID [2022-04-28 03:02:58,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {101457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101458#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:58,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {101458#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101458#(<= main_~i~0 6)} is VALID [2022-04-28 03:02:58,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {101458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101459#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:58,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {101459#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101459#(<= main_~i~0 7)} is VALID [2022-04-28 03:02:58,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {101459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101460#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:58,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {101460#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101460#(<= main_~i~0 8)} is VALID [2022-04-28 03:02:58,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {101460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101461#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:58,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {101461#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101461#(<= main_~i~0 9)} is VALID [2022-04-28 03:02:58,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {101461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101462#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:58,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {101462#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101462#(<= main_~i~0 10)} is VALID [2022-04-28 03:02:58,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {101462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101463#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:58,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {101463#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101463#(<= main_~i~0 11)} is VALID [2022-04-28 03:02:58,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {101463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101464#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:58,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {101464#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101464#(<= main_~i~0 12)} is VALID [2022-04-28 03:02:58,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {101464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101465#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:58,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {101465#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101465#(<= main_~i~0 13)} is VALID [2022-04-28 03:02:58,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {101465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101466#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:58,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {101466#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101466#(<= main_~i~0 14)} is VALID [2022-04-28 03:02:58,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {101466#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101467#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:58,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {101467#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101467#(<= main_~i~0 15)} is VALID [2022-04-28 03:02:58,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {101467#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101468#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:58,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {101468#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101468#(<= main_~i~0 16)} is VALID [2022-04-28 03:02:58,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {101468#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101469#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:58,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {101469#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101469#(<= main_~i~0 17)} is VALID [2022-04-28 03:02:58,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {101469#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101470#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:58,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {101470#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101470#(<= main_~i~0 18)} is VALID [2022-04-28 03:02:58,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {101470#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101471#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:58,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {101471#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101471#(<= main_~i~0 19)} is VALID [2022-04-28 03:02:58,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {101471#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101472#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:58,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {101472#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101472#(<= main_~i~0 20)} is VALID [2022-04-28 03:02:58,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {101472#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101473#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:58,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {101473#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101473#(<= main_~i~0 21)} is VALID [2022-04-28 03:02:58,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {101473#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101474#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:58,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {101474#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101474#(<= main_~i~0 22)} is VALID [2022-04-28 03:02:58,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {101474#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101475#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:58,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {101475#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101475#(<= main_~i~0 23)} is VALID [2022-04-28 03:02:58,202 INFO L290 TraceCheckUtils]: 53: Hoare triple {101475#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101476#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:58,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {101476#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101476#(<= main_~i~0 24)} is VALID [2022-04-28 03:02:58,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {101476#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101477#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:58,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {101477#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101477#(<= main_~i~0 25)} is VALID [2022-04-28 03:02:58,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {101477#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101478#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:58,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {101478#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101478#(<= main_~i~0 26)} is VALID [2022-04-28 03:02:58,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {101478#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101479#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:58,204 INFO L290 TraceCheckUtils]: 60: Hoare triple {101479#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101479#(<= main_~i~0 27)} is VALID [2022-04-28 03:02:58,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {101479#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101480#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:58,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {101480#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101480#(<= main_~i~0 28)} is VALID [2022-04-28 03:02:58,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {101480#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101481#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:58,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {101481#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101481#(<= main_~i~0 29)} is VALID [2022-04-28 03:02:58,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {101481#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101482#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:58,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {101482#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101482#(<= main_~i~0 30)} is VALID [2022-04-28 03:02:58,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {101482#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101483#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:58,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {101483#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101483#(<= main_~i~0 31)} is VALID [2022-04-28 03:02:58,206 INFO L290 TraceCheckUtils]: 69: Hoare triple {101483#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101484#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:58,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {101484#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101484#(<= main_~i~0 32)} is VALID [2022-04-28 03:02:58,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {101484#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101485#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:58,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {101485#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101485#(<= main_~i~0 33)} is VALID [2022-04-28 03:02:58,207 INFO L290 TraceCheckUtils]: 73: Hoare triple {101485#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101486#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:58,207 INFO L290 TraceCheckUtils]: 74: Hoare triple {101486#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101486#(<= main_~i~0 34)} is VALID [2022-04-28 03:02:58,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {101486#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101487#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:58,208 INFO L290 TraceCheckUtils]: 76: Hoare triple {101487#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101487#(<= main_~i~0 35)} is VALID [2022-04-28 03:02:58,208 INFO L290 TraceCheckUtils]: 77: Hoare triple {101487#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101488#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:58,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {101488#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101488#(<= main_~i~0 36)} is VALID [2022-04-28 03:02:58,209 INFO L290 TraceCheckUtils]: 79: Hoare triple {101488#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101489#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:58,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {101489#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101489#(<= main_~i~0 37)} is VALID [2022-04-28 03:02:58,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {101489#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101490#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:58,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {101490#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101490#(<= main_~i~0 38)} is VALID [2022-04-28 03:02:58,210 INFO L290 TraceCheckUtils]: 83: Hoare triple {101490#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101491#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:58,210 INFO L290 TraceCheckUtils]: 84: Hoare triple {101491#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101491#(<= main_~i~0 39)} is VALID [2022-04-28 03:02:58,210 INFO L290 TraceCheckUtils]: 85: Hoare triple {101491#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101492#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:58,210 INFO L290 TraceCheckUtils]: 86: Hoare triple {101492#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101492#(<= main_~i~0 40)} is VALID [2022-04-28 03:02:58,210 INFO L290 TraceCheckUtils]: 87: Hoare triple {101492#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101493#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:58,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {101493#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101493#(<= main_~i~0 41)} is VALID [2022-04-28 03:02:58,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {101493#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101494#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:58,211 INFO L290 TraceCheckUtils]: 90: Hoare triple {101494#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101494#(<= main_~i~0 42)} is VALID [2022-04-28 03:02:58,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {101494#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101495#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:58,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {101495#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101495#(<= main_~i~0 43)} is VALID [2022-04-28 03:02:58,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {101495#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101496#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:58,212 INFO L290 TraceCheckUtils]: 94: Hoare triple {101496#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101496#(<= main_~i~0 44)} is VALID [2022-04-28 03:02:58,212 INFO L290 TraceCheckUtils]: 95: Hoare triple {101496#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101497#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:58,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {101497#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101497#(<= main_~i~0 45)} is VALID [2022-04-28 03:02:58,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {101497#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101498#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:58,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {101498#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101498#(<= main_~i~0 46)} is VALID [2022-04-28 03:02:58,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {101498#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101499#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:58,214 INFO L290 TraceCheckUtils]: 100: Hoare triple {101499#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101499#(<= main_~i~0 47)} is VALID [2022-04-28 03:02:58,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {101499#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101500#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:58,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {101500#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101500#(<= main_~i~0 48)} is VALID [2022-04-28 03:02:58,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {101500#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101501#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:58,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {101501#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101501#(<= main_~i~0 49)} is VALID [2022-04-28 03:02:58,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {101501#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101502#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:58,215 INFO L290 TraceCheckUtils]: 106: Hoare triple {101502#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101502#(<= main_~i~0 50)} is VALID [2022-04-28 03:02:58,215 INFO L290 TraceCheckUtils]: 107: Hoare triple {101502#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101503#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:58,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {101503#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101503#(<= main_~i~0 51)} is VALID [2022-04-28 03:02:58,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {101503#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101504#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:58,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {101504#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101504#(<= main_~i~0 52)} is VALID [2022-04-28 03:02:58,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {101504#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101505#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:58,217 INFO L290 TraceCheckUtils]: 112: Hoare triple {101505#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101505#(<= main_~i~0 53)} is VALID [2022-04-28 03:02:58,217 INFO L290 TraceCheckUtils]: 113: Hoare triple {101505#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101506#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:58,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {101506#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101506#(<= main_~i~0 54)} is VALID [2022-04-28 03:02:58,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {101506#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101507#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:58,218 INFO L290 TraceCheckUtils]: 116: Hoare triple {101507#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101507#(<= main_~i~0 55)} is VALID [2022-04-28 03:02:58,218 INFO L290 TraceCheckUtils]: 117: Hoare triple {101507#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101508#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:58,218 INFO L290 TraceCheckUtils]: 118: Hoare triple {101508#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101508#(<= main_~i~0 56)} is VALID [2022-04-28 03:02:58,219 INFO L290 TraceCheckUtils]: 119: Hoare triple {101508#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101509#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:58,219 INFO L290 TraceCheckUtils]: 120: Hoare triple {101509#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101509#(<= main_~i~0 57)} is VALID [2022-04-28 03:02:58,219 INFO L290 TraceCheckUtils]: 121: Hoare triple {101509#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101510#(<= main_~i~0 58)} is VALID [2022-04-28 03:02:58,219 INFO L290 TraceCheckUtils]: 122: Hoare triple {101510#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101510#(<= main_~i~0 58)} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 123: Hoare triple {101510#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101511#(<= main_~i~0 59)} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 124: Hoare triple {101511#(<= main_~i~0 59)} assume !(~i~0 < 1024); {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 125: Hoare triple {101448#false} ~i~0 := 0; {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 126: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 127: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 128: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 129: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-28 03:02:58,220 INFO L290 TraceCheckUtils]: 130: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 131: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 132: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 133: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 134: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 135: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 136: Hoare triple {101448#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L272 TraceCheckUtils]: 137: Hoare triple {101448#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 138: Hoare triple {101448#false} ~cond := #in~cond; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 139: Hoare triple {101448#false} assume 0 == ~cond; {101448#false} is VALID [2022-04-28 03:02:58,221 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-28 03:02:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:02:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115122619] [2022-04-28 03:02:58,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115122619] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478144679] [2022-04-28 03:02:58,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:58,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:58,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:58,223 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:58,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 03:02:58,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:02:58,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:58,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:02:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:58,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#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(12, 2); {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,783 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,785 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101891#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 126: Hoare triple {101891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {101891#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:58,786 INFO L290 TraceCheckUtils]: 127: Hoare triple {101891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101891#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:58,787 INFO L290 TraceCheckUtils]: 128: Hoare triple {101891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101891#(<= main_~i~0 0)} is VALID [2022-04-28 03:02:58,787 INFO L290 TraceCheckUtils]: 129: Hoare triple {101891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,787 INFO L290 TraceCheckUtils]: 130: Hoare triple {101453#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,787 INFO L290 TraceCheckUtils]: 131: Hoare triple {101453#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,788 INFO L290 TraceCheckUtils]: 132: Hoare triple {101453#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101453#(<= main_~i~0 1)} is VALID [2022-04-28 03:02:58,788 INFO L290 TraceCheckUtils]: 133: Hoare triple {101453#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,788 INFO L290 TraceCheckUtils]: 134: Hoare triple {101454#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,788 INFO L290 TraceCheckUtils]: 135: Hoare triple {101454#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,788 INFO L290 TraceCheckUtils]: 136: Hoare triple {101454#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101454#(<= main_~i~0 2)} is VALID [2022-04-28 03:02:58,789 INFO L272 TraceCheckUtils]: 137: Hoare triple {101454#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:58,789 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:02:58,789 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-28 03:02:58,789 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-28 03:02:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-28 03:02:58,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:58,999 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-28 03:02:58,999 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-28 03:02:58,999 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:02:59,000 INFO L272 TraceCheckUtils]: 137: Hoare triple {101948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:59,000 INFO L290 TraceCheckUtils]: 136: Hoare triple {101948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101948#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:59,000 INFO L290 TraceCheckUtils]: 135: Hoare triple {101948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101948#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:59,000 INFO L290 TraceCheckUtils]: 134: Hoare triple {101948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {101948#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:59,000 INFO L290 TraceCheckUtils]: 133: Hoare triple {101961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101948#(<= main_~i~0 512)} is VALID [2022-04-28 03:02:59,001 INFO L290 TraceCheckUtils]: 132: Hoare triple {101961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101961#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:59,001 INFO L290 TraceCheckUtils]: 131: Hoare triple {101961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101961#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:59,001 INFO L290 TraceCheckUtils]: 130: Hoare triple {101961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {101961#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:59,001 INFO L290 TraceCheckUtils]: 129: Hoare triple {101974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101961#(<= main_~i~0 511)} is VALID [2022-04-28 03:02:59,001 INFO L290 TraceCheckUtils]: 128: Hoare triple {101974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101974#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {101974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101974#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {101974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {101974#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101974#(<= main_~i~0 510)} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,002 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,003 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#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(12, 2); {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-28 03:02:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-28 03:02:59,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478144679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:59,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 7, 7] total 69 [2022-04-28 03:02:59,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:59,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726928391] [2022-04-28 03:02:59,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726928391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:59,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:02:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878618618] [2022-04-28 03:02:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 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 141 [2022-04-28 03:02:59,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:59,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:59,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:02:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:02:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2151, Invalid=2541, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:02:59,066 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:11,316 INFO L93 Difference]: Finished difference Result 453 states and 577 transitions. [2022-04-28 03:03:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:03:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 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 141 [2022-04-28 03:03:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-28 03:03:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-28 03:03:11,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 568 transitions. [2022-04-28 03:03:11,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:11,743 INFO L225 Difference]: With dead ends: 453 [2022-04-28 03:03:11,743 INFO L226 Difference]: Without dead ends: 436 [2022-04-28 03:03:11,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6112, Invalid=10400, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 03:03:11,745 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1423 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:11,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 42 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:03:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-04-28 03:03:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 144. [2022-04-28 03:03:12,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:12,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,411 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,411 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:12,417 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-28 03:03:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-28 03:03:12,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:12,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:12,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 436 states. [2022-04-28 03:03:12,418 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 436 states. [2022-04-28 03:03:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:12,424 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-28 03:03:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-28 03:03:12,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:12,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:12,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:12,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-28 03:03:12,426 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 141 [2022-04-28 03:03:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:12,426 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-28 03:03:12,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-28 03:03:12,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:03:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 03:03:12,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:12,785 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:12,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:12,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:12,986 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 121 times [2022-04-28 03:03:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350262223] [2022-04-28 03:03:12,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:12,989 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:12,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 122 times [2022-04-28 03:03:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:12,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761121749] [2022-04-28 03:03:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:14,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {104616#(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(12, 2); {104550#true} is VALID [2022-04-28 03:03:14,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-28 03:03:14,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-28 03:03:14,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:14,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {104616#(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(12, 2); {104550#true} is VALID [2022-04-28 03:03:14,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-28 03:03:14,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-28 03:03:14,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-28 03:03:14,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104555#(= main_~i~0 0)} is VALID [2022-04-28 03:03:14,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {104555#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104555#(= main_~i~0 0)} is VALID [2022-04-28 03:03:14,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {104555#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:14,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:14,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:14,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:14,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:14,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:14,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:14,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:14,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:14,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:14,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:14,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:14,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:14,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:14,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:14,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:14,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:14,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:14,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:14,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:14,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:14,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:14,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:14,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:14,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:14,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:14,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:14,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:14,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:14,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:14,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:14,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:14,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:14,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:14,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:14,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:14,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:14,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:14,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:14,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:14,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:14,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:14,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:14,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:14,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:14,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:14,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:14,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:14,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:14,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:14,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:14,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:14,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:14,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:14,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:14,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:14,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:14,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:14,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:14,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:14,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:14,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:14,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:14,175 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:14,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:14,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:14,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:14,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:14,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:14,176 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:14,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:14,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:14,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:14,178 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:14,178 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:14,178 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:14,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:14,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:14,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:14,180 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:14,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:14,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:14,181 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:14,181 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:14,181 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:14,182 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:14,182 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:14,182 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:14,183 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:14,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:14,183 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:14,183 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:14,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:14,184 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:14,186 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:14,186 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:14,186 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:14,188 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:14,188 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:14,188 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:14,189 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:14,189 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:14,189 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:14,190 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:14,190 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:14,190 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:14,191 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:14,191 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:14,191 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:14,192 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:14,192 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:14,192 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-28 03:03:14,193 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-28 03:03:14,194 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-28 03:03:14,194 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-28 03:03:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:14,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:14,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761121749] [2022-04-28 03:03:14,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761121749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:14,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585620900] [2022-04-28 03:03:14,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:14,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:14,196 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:14,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 03:03:14,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:14,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:14,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-28 03:03:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:14,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:15,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-28 03:03:15,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#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(12, 2); {104550#true} is VALID [2022-04-28 03:03:15,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-28 03:03:15,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-28 03:03:15,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-28 03:03:15,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104635#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:15,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {104635#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104635#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:15,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {104635#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:15,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:15,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:15,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:15,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:15,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:15,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:15,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:15,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:15,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:15,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:15,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:15,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:15,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:15,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:15,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:15,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:15,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:15,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:15,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:15,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:15,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:15,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:15,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:15,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:15,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:15,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:15,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:15,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:15,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:15,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:15,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:15,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:15,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:15,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:15,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:15,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:15,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:15,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:15,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:15,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:15,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:15,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:15,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:15,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:15,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:15,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:15,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:15,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:15,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:15,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:15,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:15,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:15,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:15,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:15,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:15,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:15,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:15,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:15,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:15,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:15,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:15,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:15,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:15,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:15,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:15,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:15,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:15,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:15,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:15,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:15,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:15,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:15,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:15,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:15,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:15,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:15,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:15,601 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:15,601 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:15,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:15,602 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:15,602 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:15,603 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:15,603 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:15,603 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:15,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:15,604 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:15,604 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:15,605 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:15,605 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:15,605 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:15,606 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:15,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:15,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:15,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:15,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:15,607 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:15,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:15,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:15,609 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:15,609 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:15,609 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:15,610 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:15,610 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:15,610 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:15,611 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:15,611 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:15,611 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:15,612 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:15,612 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:15,612 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:15,613 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:15,613 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:15,613 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:15,614 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:15,614 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:15,614 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:15,615 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-28 03:03:15,616 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-28 03:03:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:15,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:19,097 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-28 03:03:19,097 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 126: Hoare triple {105095#(< main_~i~0 1024)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 125: Hoare triple {105099#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105095#(< main_~i~0 1024)} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 124: Hoare triple {105099#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105099#(< main_~i~0 1023)} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 123: Hoare triple {105106#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105099#(< main_~i~0 1023)} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 122: Hoare triple {105106#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105106#(< main_~i~0 1022)} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 121: Hoare triple {105113#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105106#(< main_~i~0 1022)} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 120: Hoare triple {105113#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105113#(< main_~i~0 1021)} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 119: Hoare triple {105120#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105113#(< main_~i~0 1021)} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 118: Hoare triple {105120#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105120#(< main_~i~0 1020)} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 117: Hoare triple {105127#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105120#(< main_~i~0 1020)} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 116: Hoare triple {105127#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105127#(< main_~i~0 1019)} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 115: Hoare triple {105134#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105127#(< main_~i~0 1019)} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 114: Hoare triple {105134#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105134#(< main_~i~0 1018)} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 113: Hoare triple {105141#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105134#(< main_~i~0 1018)} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 112: Hoare triple {105141#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105141#(< main_~i~0 1017)} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 111: Hoare triple {105148#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105141#(< main_~i~0 1017)} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {105148#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105148#(< main_~i~0 1016)} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {105155#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105148#(< main_~i~0 1016)} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 108: Hoare triple {105155#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105155#(< main_~i~0 1015)} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 107: Hoare triple {105162#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105155#(< main_~i~0 1015)} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 106: Hoare triple {105162#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105162#(< main_~i~0 1014)} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 105: Hoare triple {105169#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105162#(< main_~i~0 1014)} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 104: Hoare triple {105169#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105169#(< main_~i~0 1013)} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 103: Hoare triple {105176#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105169#(< main_~i~0 1013)} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 102: Hoare triple {105176#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105176#(< main_~i~0 1012)} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 101: Hoare triple {105183#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105176#(< main_~i~0 1012)} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 100: Hoare triple {105183#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105183#(< main_~i~0 1011)} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 99: Hoare triple {105190#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105183#(< main_~i~0 1011)} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {105190#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105190#(< main_~i~0 1010)} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {105197#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105190#(< main_~i~0 1010)} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {105197#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105197#(< main_~i~0 1009)} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 95: Hoare triple {105204#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105197#(< main_~i~0 1009)} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {105204#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105204#(< main_~i~0 1008)} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {105211#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105204#(< main_~i~0 1008)} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 92: Hoare triple {105211#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105211#(< main_~i~0 1007)} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 91: Hoare triple {105218#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105211#(< main_~i~0 1007)} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 90: Hoare triple {105218#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105218#(< main_~i~0 1006)} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 89: Hoare triple {105225#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105218#(< main_~i~0 1006)} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {105225#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105225#(< main_~i~0 1005)} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 87: Hoare triple {105232#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105225#(< main_~i~0 1005)} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 86: Hoare triple {105232#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105232#(< main_~i~0 1004)} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 85: Hoare triple {105239#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105232#(< main_~i~0 1004)} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {105239#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105239#(< main_~i~0 1003)} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {105246#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105239#(< main_~i~0 1003)} is VALID [2022-04-28 03:03:19,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {105246#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105246#(< main_~i~0 1002)} is VALID [2022-04-28 03:03:19,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {105253#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105246#(< main_~i~0 1002)} is VALID [2022-04-28 03:03:19,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {105253#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105253#(< main_~i~0 1001)} is VALID [2022-04-28 03:03:19,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {105260#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105253#(< main_~i~0 1001)} is VALID [2022-04-28 03:03:19,110 INFO L290 TraceCheckUtils]: 78: Hoare triple {105260#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105260#(< main_~i~0 1000)} is VALID [2022-04-28 03:03:19,110 INFO L290 TraceCheckUtils]: 77: Hoare triple {105267#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105260#(< main_~i~0 1000)} is VALID [2022-04-28 03:03:19,110 INFO L290 TraceCheckUtils]: 76: Hoare triple {105267#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105267#(< main_~i~0 999)} is VALID [2022-04-28 03:03:19,110 INFO L290 TraceCheckUtils]: 75: Hoare triple {105274#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105267#(< main_~i~0 999)} is VALID [2022-04-28 03:03:19,110 INFO L290 TraceCheckUtils]: 74: Hoare triple {105274#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105274#(< main_~i~0 998)} is VALID [2022-04-28 03:03:19,111 INFO L290 TraceCheckUtils]: 73: Hoare triple {105281#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105274#(< main_~i~0 998)} is VALID [2022-04-28 03:03:19,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {105281#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105281#(< main_~i~0 997)} is VALID [2022-04-28 03:03:19,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {105288#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105281#(< main_~i~0 997)} is VALID [2022-04-28 03:03:19,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {105288#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105288#(< main_~i~0 996)} is VALID [2022-04-28 03:03:19,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {105295#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105288#(< main_~i~0 996)} is VALID [2022-04-28 03:03:19,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {105295#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105295#(< main_~i~0 995)} is VALID [2022-04-28 03:03:19,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {105302#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105295#(< main_~i~0 995)} is VALID [2022-04-28 03:03:19,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {105302#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105302#(< main_~i~0 994)} is VALID [2022-04-28 03:03:19,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {105309#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105302#(< main_~i~0 994)} is VALID [2022-04-28 03:03:19,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {105309#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105309#(< main_~i~0 993)} is VALID [2022-04-28 03:03:19,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {105316#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105309#(< main_~i~0 993)} is VALID [2022-04-28 03:03:19,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {105316#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105316#(< main_~i~0 992)} is VALID [2022-04-28 03:03:19,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {105323#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105316#(< main_~i~0 992)} is VALID [2022-04-28 03:03:19,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {105323#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105323#(< main_~i~0 991)} is VALID [2022-04-28 03:03:19,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {105330#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105323#(< main_~i~0 991)} is VALID [2022-04-28 03:03:19,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {105330#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105330#(< main_~i~0 990)} is VALID [2022-04-28 03:03:19,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {105337#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105330#(< main_~i~0 990)} is VALID [2022-04-28 03:03:19,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {105337#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105337#(< main_~i~0 989)} is VALID [2022-04-28 03:03:19,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {105344#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105337#(< main_~i~0 989)} is VALID [2022-04-28 03:03:19,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {105344#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105344#(< main_~i~0 988)} is VALID [2022-04-28 03:03:19,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {105351#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105344#(< main_~i~0 988)} is VALID [2022-04-28 03:03:19,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {105351#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105351#(< main_~i~0 987)} is VALID [2022-04-28 03:03:19,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {105358#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105351#(< main_~i~0 987)} is VALID [2022-04-28 03:03:19,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {105358#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105358#(< main_~i~0 986)} is VALID [2022-04-28 03:03:19,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {105365#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105358#(< main_~i~0 986)} is VALID [2022-04-28 03:03:19,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {105365#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105365#(< main_~i~0 985)} is VALID [2022-04-28 03:03:19,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {105372#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105365#(< main_~i~0 985)} is VALID [2022-04-28 03:03:19,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {105372#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105372#(< main_~i~0 984)} is VALID [2022-04-28 03:03:19,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {105379#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105372#(< main_~i~0 984)} is VALID [2022-04-28 03:03:19,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {105379#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105379#(< main_~i~0 983)} is VALID [2022-04-28 03:03:19,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {105386#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105379#(< main_~i~0 983)} is VALID [2022-04-28 03:03:19,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {105386#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105386#(< main_~i~0 982)} is VALID [2022-04-28 03:03:19,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {105393#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105386#(< main_~i~0 982)} is VALID [2022-04-28 03:03:19,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {105393#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105393#(< main_~i~0 981)} is VALID [2022-04-28 03:03:19,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {105400#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105393#(< main_~i~0 981)} is VALID [2022-04-28 03:03:19,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {105400#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105400#(< main_~i~0 980)} is VALID [2022-04-28 03:03:19,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {105407#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105400#(< main_~i~0 980)} is VALID [2022-04-28 03:03:19,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {105407#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105407#(< main_~i~0 979)} is VALID [2022-04-28 03:03:19,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {105414#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105407#(< main_~i~0 979)} is VALID [2022-04-28 03:03:19,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {105414#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105414#(< main_~i~0 978)} is VALID [2022-04-28 03:03:19,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {105421#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105414#(< main_~i~0 978)} is VALID [2022-04-28 03:03:19,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {105421#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105421#(< main_~i~0 977)} is VALID [2022-04-28 03:03:19,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {105428#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105421#(< main_~i~0 977)} is VALID [2022-04-28 03:03:19,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {105428#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105428#(< main_~i~0 976)} is VALID [2022-04-28 03:03:19,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {105435#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105428#(< main_~i~0 976)} is VALID [2022-04-28 03:03:19,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {105435#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105435#(< main_~i~0 975)} is VALID [2022-04-28 03:03:19,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {105442#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105435#(< main_~i~0 975)} is VALID [2022-04-28 03:03:19,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {105442#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105442#(< main_~i~0 974)} is VALID [2022-04-28 03:03:19,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {105449#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105442#(< main_~i~0 974)} is VALID [2022-04-28 03:03:19,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {105449#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105449#(< main_~i~0 973)} is VALID [2022-04-28 03:03:19,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {105456#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105449#(< main_~i~0 973)} is VALID [2022-04-28 03:03:19,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {105456#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105456#(< main_~i~0 972)} is VALID [2022-04-28 03:03:19,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {105463#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105456#(< main_~i~0 972)} is VALID [2022-04-28 03:03:19,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {105463#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105463#(< main_~i~0 971)} is VALID [2022-04-28 03:03:19,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {105470#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105463#(< main_~i~0 971)} is VALID [2022-04-28 03:03:19,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {105470#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105470#(< main_~i~0 970)} is VALID [2022-04-28 03:03:19,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {105477#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105470#(< main_~i~0 970)} is VALID [2022-04-28 03:03:19,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {105477#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105477#(< main_~i~0 969)} is VALID [2022-04-28 03:03:19,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {105484#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105477#(< main_~i~0 969)} is VALID [2022-04-28 03:03:19,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {105484#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105484#(< main_~i~0 968)} is VALID [2022-04-28 03:03:19,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {105491#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105484#(< main_~i~0 968)} is VALID [2022-04-28 03:03:19,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {105491#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105491#(< main_~i~0 967)} is VALID [2022-04-28 03:03:19,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {105498#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105491#(< main_~i~0 967)} is VALID [2022-04-28 03:03:19,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {105498#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105498#(< main_~i~0 966)} is VALID [2022-04-28 03:03:19,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {105505#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105498#(< main_~i~0 966)} is VALID [2022-04-28 03:03:19,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {105505#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105505#(< main_~i~0 965)} is VALID [2022-04-28 03:03:19,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {105512#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105505#(< main_~i~0 965)} is VALID [2022-04-28 03:03:19,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {105512#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105512#(< main_~i~0 964)} is VALID [2022-04-28 03:03:19,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {105512#(< main_~i~0 964)} is VALID [2022-04-28 03:03:19,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-28 03:03:19,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-28 03:03:19,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-28 03:03:19,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#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(12, 2); {104550#true} is VALID [2022-04-28 03:03:19,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-28 03:03:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:19,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585620900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:19,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:19,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-28 03:03:19,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350262223] [2022-04-28 03:03:19,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350262223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:19,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:19,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:03:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659499138] [2022-04-28 03:03:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 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 143 [2022-04-28 03:03:19,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:19,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:19,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:19,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:03:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:03:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-28 03:03:19,187 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:33,286 INFO L93 Difference]: Finished difference Result 460 states and 586 transitions. [2022-04-28 03:03:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:03:33,287 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 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 143 [2022-04-28 03:03:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-28 03:03:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-28 03:03:33,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 577 transitions. [2022-04-28 03:03:33,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:33,711 INFO L225 Difference]: With dead ends: 460 [2022-04-28 03:03:33,711 INFO L226 Difference]: Without dead ends: 443 [2022-04-28 03:03:33,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-28 03:03:33,713 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1772 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:33,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 42 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:03:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-28 03:03:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 146. [2022-04-28 03:03:34,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:34,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,708 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,708 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:34,715 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-28 03:03:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-28 03:03:34,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:34,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:34,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 03:03:34,715 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 03:03:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:34,721 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-28 03:03:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-28 03:03:34,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:34,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:34,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:34,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-28 03:03:34,723 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 143 [2022-04-28 03:03:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:34,723 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-28 03:03:34,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-28 03:03:35,111 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-28 03:03:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-28 03:03:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 03:03:35,112 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:35,112 INFO L195 NwaCegarLoop]: trace histogram [61, 61, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:35,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:35,330 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 123 times [2022-04-28 03:03:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828483901] [2022-04-28 03:03:35,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:35,333 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:35,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 124 times [2022-04-28 03:03:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293207286] [2022-04-28 03:03:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {107823#(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(12, 2); {107756#true} is VALID [2022-04-28 03:03:36,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-28 03:03:36,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-28 03:03:36,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:36,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {107823#(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(12, 2); {107756#true} is VALID [2022-04-28 03:03:36,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-28 03:03:36,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-28 03:03:36,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-28 03:03:36,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107761#(= main_~i~0 0)} is VALID [2022-04-28 03:03:36,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {107761#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107761#(= main_~i~0 0)} is VALID [2022-04-28 03:03:36,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {107761#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:36,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:36,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:36,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:36,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:36,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:36,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:36,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:36,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:36,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:36,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:36,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:36,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:36,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:36,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:36,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:36,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:36,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:36,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:36,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:36,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:36,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:36,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:36,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:36,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:36,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:36,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:36,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:36,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:36,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:36,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:36,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:36,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:36,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:36,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:36,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:36,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:36,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:36,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:36,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:36,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:36,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:36,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:36,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:36,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:36,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:36,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:36,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:36,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:36,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:36,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:36,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:36,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:36,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:36,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:36,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:36,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:36,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:36,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:36,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:36,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:36,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:36,181 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:36,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:36,181 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:36,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:36,181 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:36,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:36,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:36,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:36,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:36,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:36,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:36,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:36,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:36,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:36,184 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:36,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:36,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:36,184 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:36,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:36,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:36,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:36,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:36,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:36,186 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:36,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:36,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:36,186 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:36,186 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:36,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:36,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:36,187 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:36,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:36,188 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:36,188 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:36,188 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:36,188 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:36,188 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:36,189 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:36,189 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:36,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:36,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:36,190 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:36,190 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:36,190 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:36,190 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:36,190 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:36,191 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:36,191 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:36,191 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:36,191 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:36,192 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:36,192 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:36,192 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:36,192 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:36,192 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:36,193 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:36,193 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:36,193 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:36,193 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-28 03:03:36,194 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-28 03:03:36,195 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-28 03:03:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:36,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:36,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293207286] [2022-04-28 03:03:36,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293207286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:36,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951941270] [2022-04-28 03:03:36,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:36,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:36,198 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:36,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 03:03:36,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:36,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:36,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 03:03:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:37,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-28 03:03:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#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(12, 2); {107756#true} is VALID [2022-04-28 03:03:37,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-28 03:03:37,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-28 03:03:37,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-28 03:03:37,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107842#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:37,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {107842#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107842#(<= main_~i~0 0)} is VALID [2022-04-28 03:03:37,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {107842#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:37,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:37,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:37,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:37,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:37,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:37,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:37,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:37,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:37,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:37,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:37,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:37,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:37,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:37,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:37,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:37,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:37,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:37,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:37,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:37,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:37,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:37,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:37,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:37,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:37,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:37,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:37,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:37,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:37,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:37,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:37,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:37,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:37,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:37,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:37,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:37,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:37,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:37,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:37,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:37,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:37,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:37,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:37,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:37,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:37,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:37,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:37,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:37,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:37,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:37,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:37,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:37,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:37,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:37,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:37,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:37,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:37,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:37,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:37,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:37,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:37,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:37,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:37,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:37,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:37,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:37,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:37,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:37,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:37,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:37,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:37,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:37,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:37,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:37,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:37,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:37,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:37,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:37,533 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:37,533 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:37,533 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:37,533 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:37,534 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:37,534 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:37,534 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:37,534 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:37,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:37,535 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:37,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:37,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:37,535 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:37,536 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:37,536 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:37,536 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:37,536 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:37,536 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:37,537 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:37,537 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:37,537 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:37,537 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:37,538 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:37,538 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:37,538 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:37,538 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:37,538 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:37,539 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:37,539 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:37,539 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:37,539 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:37,540 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:37,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:37,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:37,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:37,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:37,541 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:37,541 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:37,541 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:37,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:37,542 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-28 03:03:37,543 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-28 03:03:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:37,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:40,761 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-28 03:03:40,762 INFO L290 TraceCheckUtils]: 128: Hoare triple {108308#(< main_~i~0 1024)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-28 03:03:40,763 INFO L290 TraceCheckUtils]: 127: Hoare triple {108312#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108308#(< main_~i~0 1024)} is VALID [2022-04-28 03:03:40,763 INFO L290 TraceCheckUtils]: 126: Hoare triple {108312#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108312#(< main_~i~0 1023)} is VALID [2022-04-28 03:03:40,763 INFO L290 TraceCheckUtils]: 125: Hoare triple {108319#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108312#(< main_~i~0 1023)} is VALID [2022-04-28 03:03:40,763 INFO L290 TraceCheckUtils]: 124: Hoare triple {108319#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108319#(< main_~i~0 1022)} is VALID [2022-04-28 03:03:40,764 INFO L290 TraceCheckUtils]: 123: Hoare triple {108326#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108319#(< main_~i~0 1022)} is VALID [2022-04-28 03:03:40,764 INFO L290 TraceCheckUtils]: 122: Hoare triple {108326#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108326#(< main_~i~0 1021)} is VALID [2022-04-28 03:03:40,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {108333#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108326#(< main_~i~0 1021)} is VALID [2022-04-28 03:03:40,764 INFO L290 TraceCheckUtils]: 120: Hoare triple {108333#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108333#(< main_~i~0 1020)} is VALID [2022-04-28 03:03:40,765 INFO L290 TraceCheckUtils]: 119: Hoare triple {108340#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108333#(< main_~i~0 1020)} is VALID [2022-04-28 03:03:40,765 INFO L290 TraceCheckUtils]: 118: Hoare triple {108340#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108340#(< main_~i~0 1019)} is VALID [2022-04-28 03:03:40,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {108347#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108340#(< main_~i~0 1019)} is VALID [2022-04-28 03:03:40,765 INFO L290 TraceCheckUtils]: 116: Hoare triple {108347#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108347#(< main_~i~0 1018)} is VALID [2022-04-28 03:03:40,766 INFO L290 TraceCheckUtils]: 115: Hoare triple {108354#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108347#(< main_~i~0 1018)} is VALID [2022-04-28 03:03:40,766 INFO L290 TraceCheckUtils]: 114: Hoare triple {108354#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108354#(< main_~i~0 1017)} is VALID [2022-04-28 03:03:40,766 INFO L290 TraceCheckUtils]: 113: Hoare triple {108361#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108354#(< main_~i~0 1017)} is VALID [2022-04-28 03:03:40,766 INFO L290 TraceCheckUtils]: 112: Hoare triple {108361#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108361#(< main_~i~0 1016)} is VALID [2022-04-28 03:03:40,767 INFO L290 TraceCheckUtils]: 111: Hoare triple {108368#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108361#(< main_~i~0 1016)} is VALID [2022-04-28 03:03:40,767 INFO L290 TraceCheckUtils]: 110: Hoare triple {108368#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108368#(< main_~i~0 1015)} is VALID [2022-04-28 03:03:40,767 INFO L290 TraceCheckUtils]: 109: Hoare triple {108375#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108368#(< main_~i~0 1015)} is VALID [2022-04-28 03:03:40,768 INFO L290 TraceCheckUtils]: 108: Hoare triple {108375#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108375#(< main_~i~0 1014)} is VALID [2022-04-28 03:03:40,768 INFO L290 TraceCheckUtils]: 107: Hoare triple {108382#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108375#(< main_~i~0 1014)} is VALID [2022-04-28 03:03:40,768 INFO L290 TraceCheckUtils]: 106: Hoare triple {108382#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108382#(< main_~i~0 1013)} is VALID [2022-04-28 03:03:40,768 INFO L290 TraceCheckUtils]: 105: Hoare triple {108389#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108382#(< main_~i~0 1013)} is VALID [2022-04-28 03:03:40,769 INFO L290 TraceCheckUtils]: 104: Hoare triple {108389#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108389#(< main_~i~0 1012)} is VALID [2022-04-28 03:03:40,769 INFO L290 TraceCheckUtils]: 103: Hoare triple {108396#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108389#(< main_~i~0 1012)} is VALID [2022-04-28 03:03:40,769 INFO L290 TraceCheckUtils]: 102: Hoare triple {108396#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108396#(< main_~i~0 1011)} is VALID [2022-04-28 03:03:40,769 INFO L290 TraceCheckUtils]: 101: Hoare triple {108403#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108396#(< main_~i~0 1011)} is VALID [2022-04-28 03:03:40,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {108403#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108403#(< main_~i~0 1010)} is VALID [2022-04-28 03:03:40,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {108410#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108403#(< main_~i~0 1010)} is VALID [2022-04-28 03:03:40,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {108410#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108410#(< main_~i~0 1009)} is VALID [2022-04-28 03:03:40,770 INFO L290 TraceCheckUtils]: 97: Hoare triple {108417#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108410#(< main_~i~0 1009)} is VALID [2022-04-28 03:03:40,771 INFO L290 TraceCheckUtils]: 96: Hoare triple {108417#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108417#(< main_~i~0 1008)} is VALID [2022-04-28 03:03:40,771 INFO L290 TraceCheckUtils]: 95: Hoare triple {108424#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108417#(< main_~i~0 1008)} is VALID [2022-04-28 03:03:40,771 INFO L290 TraceCheckUtils]: 94: Hoare triple {108424#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108424#(< main_~i~0 1007)} is VALID [2022-04-28 03:03:40,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {108431#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108424#(< main_~i~0 1007)} is VALID [2022-04-28 03:03:40,772 INFO L290 TraceCheckUtils]: 92: Hoare triple {108431#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108431#(< main_~i~0 1006)} is VALID [2022-04-28 03:03:40,772 INFO L290 TraceCheckUtils]: 91: Hoare triple {108438#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108431#(< main_~i~0 1006)} is VALID [2022-04-28 03:03:40,772 INFO L290 TraceCheckUtils]: 90: Hoare triple {108438#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108438#(< main_~i~0 1005)} is VALID [2022-04-28 03:03:40,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {108445#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108438#(< main_~i~0 1005)} is VALID [2022-04-28 03:03:40,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {108445#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108445#(< main_~i~0 1004)} is VALID [2022-04-28 03:03:40,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {108452#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108445#(< main_~i~0 1004)} is VALID [2022-04-28 03:03:40,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {108452#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108452#(< main_~i~0 1003)} is VALID [2022-04-28 03:03:40,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {108459#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108452#(< main_~i~0 1003)} is VALID [2022-04-28 03:03:40,774 INFO L290 TraceCheckUtils]: 84: Hoare triple {108459#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108459#(< main_~i~0 1002)} is VALID [2022-04-28 03:03:40,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {108466#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108459#(< main_~i~0 1002)} is VALID [2022-04-28 03:03:40,774 INFO L290 TraceCheckUtils]: 82: Hoare triple {108466#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108466#(< main_~i~0 1001)} is VALID [2022-04-28 03:03:40,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {108473#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108466#(< main_~i~0 1001)} is VALID [2022-04-28 03:03:40,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {108473#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108473#(< main_~i~0 1000)} is VALID [2022-04-28 03:03:40,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {108480#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108473#(< main_~i~0 1000)} is VALID [2022-04-28 03:03:40,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {108480#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108480#(< main_~i~0 999)} is VALID [2022-04-28 03:03:40,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {108487#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108480#(< main_~i~0 999)} is VALID [2022-04-28 03:03:40,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {108487#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108487#(< main_~i~0 998)} is VALID [2022-04-28 03:03:40,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {108494#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108487#(< main_~i~0 998)} is VALID [2022-04-28 03:03:40,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {108494#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108494#(< main_~i~0 997)} is VALID [2022-04-28 03:03:40,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {108501#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108494#(< main_~i~0 997)} is VALID [2022-04-28 03:03:40,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {108501#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108501#(< main_~i~0 996)} is VALID [2022-04-28 03:03:40,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {108508#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108501#(< main_~i~0 996)} is VALID [2022-04-28 03:03:40,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {108508#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108508#(< main_~i~0 995)} is VALID [2022-04-28 03:03:40,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {108515#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108508#(< main_~i~0 995)} is VALID [2022-04-28 03:03:40,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {108515#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108515#(< main_~i~0 994)} is VALID [2022-04-28 03:03:40,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {108522#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108515#(< main_~i~0 994)} is VALID [2022-04-28 03:03:40,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {108522#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108522#(< main_~i~0 993)} is VALID [2022-04-28 03:03:40,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {108529#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108522#(< main_~i~0 993)} is VALID [2022-04-28 03:03:40,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {108529#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108529#(< main_~i~0 992)} is VALID [2022-04-28 03:03:40,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {108536#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108529#(< main_~i~0 992)} is VALID [2022-04-28 03:03:40,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {108536#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108536#(< main_~i~0 991)} is VALID [2022-04-28 03:03:40,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {108543#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108536#(< main_~i~0 991)} is VALID [2022-04-28 03:03:40,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {108543#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108543#(< main_~i~0 990)} is VALID [2022-04-28 03:03:40,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {108550#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108543#(< main_~i~0 990)} is VALID [2022-04-28 03:03:40,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {108550#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108550#(< main_~i~0 989)} is VALID [2022-04-28 03:03:40,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {108557#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108550#(< main_~i~0 989)} is VALID [2022-04-28 03:03:40,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {108557#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108557#(< main_~i~0 988)} is VALID [2022-04-28 03:03:40,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {108564#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108557#(< main_~i~0 988)} is VALID [2022-04-28 03:03:40,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {108564#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108564#(< main_~i~0 987)} is VALID [2022-04-28 03:03:40,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {108571#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108564#(< main_~i~0 987)} is VALID [2022-04-28 03:03:40,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {108571#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108571#(< main_~i~0 986)} is VALID [2022-04-28 03:03:40,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {108578#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108571#(< main_~i~0 986)} is VALID [2022-04-28 03:03:40,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {108578#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108578#(< main_~i~0 985)} is VALID [2022-04-28 03:03:40,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {108585#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108578#(< main_~i~0 985)} is VALID [2022-04-28 03:03:40,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {108585#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108585#(< main_~i~0 984)} is VALID [2022-04-28 03:03:40,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {108592#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108585#(< main_~i~0 984)} is VALID [2022-04-28 03:03:40,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {108592#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108592#(< main_~i~0 983)} is VALID [2022-04-28 03:03:40,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {108599#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108592#(< main_~i~0 983)} is VALID [2022-04-28 03:03:40,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {108599#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108599#(< main_~i~0 982)} is VALID [2022-04-28 03:03:40,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {108606#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108599#(< main_~i~0 982)} is VALID [2022-04-28 03:03:40,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {108606#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108606#(< main_~i~0 981)} is VALID [2022-04-28 03:03:40,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {108613#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108606#(< main_~i~0 981)} is VALID [2022-04-28 03:03:40,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {108613#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108613#(< main_~i~0 980)} is VALID [2022-04-28 03:03:40,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {108620#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108613#(< main_~i~0 980)} is VALID [2022-04-28 03:03:40,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {108620#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108620#(< main_~i~0 979)} is VALID [2022-04-28 03:03:40,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {108627#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108620#(< main_~i~0 979)} is VALID [2022-04-28 03:03:40,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {108627#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108627#(< main_~i~0 978)} is VALID [2022-04-28 03:03:40,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {108634#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108627#(< main_~i~0 978)} is VALID [2022-04-28 03:03:40,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {108634#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108634#(< main_~i~0 977)} is VALID [2022-04-28 03:03:40,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {108641#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108634#(< main_~i~0 977)} is VALID [2022-04-28 03:03:40,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {108641#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108641#(< main_~i~0 976)} is VALID [2022-04-28 03:03:40,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {108648#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108641#(< main_~i~0 976)} is VALID [2022-04-28 03:03:40,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {108648#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108648#(< main_~i~0 975)} is VALID [2022-04-28 03:03:40,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {108655#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108648#(< main_~i~0 975)} is VALID [2022-04-28 03:03:40,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {108655#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108655#(< main_~i~0 974)} is VALID [2022-04-28 03:03:40,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {108662#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108655#(< main_~i~0 974)} is VALID [2022-04-28 03:03:40,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {108662#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108662#(< main_~i~0 973)} is VALID [2022-04-28 03:03:40,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {108669#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108662#(< main_~i~0 973)} is VALID [2022-04-28 03:03:40,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {108669#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108669#(< main_~i~0 972)} is VALID [2022-04-28 03:03:40,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {108676#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108669#(< main_~i~0 972)} is VALID [2022-04-28 03:03:40,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {108676#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108676#(< main_~i~0 971)} is VALID [2022-04-28 03:03:40,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {108683#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108676#(< main_~i~0 971)} is VALID [2022-04-28 03:03:40,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {108683#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108683#(< main_~i~0 970)} is VALID [2022-04-28 03:03:40,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {108690#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108683#(< main_~i~0 970)} is VALID [2022-04-28 03:03:40,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {108690#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108690#(< main_~i~0 969)} is VALID [2022-04-28 03:03:40,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {108697#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108690#(< main_~i~0 969)} is VALID [2022-04-28 03:03:40,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {108697#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108697#(< main_~i~0 968)} is VALID [2022-04-28 03:03:40,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {108704#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108697#(< main_~i~0 968)} is VALID [2022-04-28 03:03:40,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {108704#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108704#(< main_~i~0 967)} is VALID [2022-04-28 03:03:40,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {108711#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108704#(< main_~i~0 967)} is VALID [2022-04-28 03:03:40,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {108711#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108711#(< main_~i~0 966)} is VALID [2022-04-28 03:03:40,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {108718#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108711#(< main_~i~0 966)} is VALID [2022-04-28 03:03:40,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {108718#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108718#(< main_~i~0 965)} is VALID [2022-04-28 03:03:40,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {108725#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108718#(< main_~i~0 965)} is VALID [2022-04-28 03:03:40,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {108725#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108725#(< main_~i~0 964)} is VALID [2022-04-28 03:03:40,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {108732#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108725#(< main_~i~0 964)} is VALID [2022-04-28 03:03:40,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {108732#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108732#(< main_~i~0 963)} is VALID [2022-04-28 03:03:40,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {108732#(< main_~i~0 963)} is VALID [2022-04-28 03:03:40,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-28 03:03:40,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-28 03:03:40,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-28 03:03:40,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#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(12, 2); {107756#true} is VALID [2022-04-28 03:03:40,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-28 03:03:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:40,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951941270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:40,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:40,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-28 03:03:40,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:40,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828483901] [2022-04-28 03:03:40,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828483901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:40,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:40,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 03:03:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841209844] [2022-04-28 03:03:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 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 145 [2022-04-28 03:03:40,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:40,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:40,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 03:03:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 03:03:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:03:40,861 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:56,061 INFO L93 Difference]: Finished difference Result 467 states and 595 transitions. [2022-04-28 03:03:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:03:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 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 145 [2022-04-28 03:03:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-28 03:03:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-28 03:03:56,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 586 transitions. [2022-04-28 03:03:56,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:56,501 INFO L225 Difference]: With dead ends: 467 [2022-04-28 03:03:56,501 INFO L226 Difference]: Without dead ends: 450 [2022-04-28 03:03:56,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-28 03:03:56,503 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1670 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:56,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 52 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:03:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-28 03:03:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 148. [2022-04-28 03:03:57,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:57,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:57,403 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:57,403 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:57,410 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-28 03:03:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-28 03:03:57,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:57,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:57,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-28 03:03:57,410 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 450 states. [2022-04-28 03:03:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:57,417 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-28 03:03:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-28 03:03:57,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:57,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:57,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:57,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-04-28 03:03:57,419 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 145 [2022-04-28 03:03:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:57,419 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-04-28 03:03:57,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:57,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 152 transitions. [2022-04-28 03:03:57,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-04-28 03:03:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 03:03:57,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:57,799 INFO L195 NwaCegarLoop]: trace histogram [62, 62, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:57,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:58,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-28 03:03:58,016 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 125 times [2022-04-28 03:03:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:58,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313478480] [2022-04-28 03:03:58,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:58,020 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:03:58,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:03:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 126 times [2022-04-28 03:03:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:58,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504618425] [2022-04-28 03:03:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:59,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {111078#(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(12, 2); {111010#true} is VALID [2022-04-28 03:03:59,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-28 03:03:59,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-28 03:03:59,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:59,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {111078#(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(12, 2); {111010#true} is VALID [2022-04-28 03:03:59,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-28 03:03:59,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-28 03:03:59,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-28 03:03:59,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111015#(= main_~i~0 0)} is VALID [2022-04-28 03:03:59,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {111015#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111015#(= main_~i~0 0)} is VALID [2022-04-28 03:03:59,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {111015#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:59,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {111016#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:03:59,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {111016#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:59,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {111017#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:03:59,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {111017#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111018#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:59,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {111018#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111018#(<= main_~i~0 3)} is VALID [2022-04-28 03:03:59,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {111018#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111019#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:59,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {111019#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111019#(<= main_~i~0 4)} is VALID [2022-04-28 03:03:59,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {111019#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111020#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:59,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {111020#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111020#(<= main_~i~0 5)} is VALID [2022-04-28 03:03:59,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {111020#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111021#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:59,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {111021#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111021#(<= main_~i~0 6)} is VALID [2022-04-28 03:03:59,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {111021#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111022#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:59,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {111022#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111022#(<= main_~i~0 7)} is VALID [2022-04-28 03:03:59,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {111022#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111023#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:59,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {111023#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111023#(<= main_~i~0 8)} is VALID [2022-04-28 03:03:59,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {111023#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111024#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:59,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {111024#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111024#(<= main_~i~0 9)} is VALID [2022-04-28 03:03:59,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {111024#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111025#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:59,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {111025#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111025#(<= main_~i~0 10)} is VALID [2022-04-28 03:03:59,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {111025#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111026#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:59,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {111026#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111026#(<= main_~i~0 11)} is VALID [2022-04-28 03:03:59,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {111026#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111027#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:59,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {111027#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111027#(<= main_~i~0 12)} is VALID [2022-04-28 03:03:59,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {111027#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111028#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:59,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {111028#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111028#(<= main_~i~0 13)} is VALID [2022-04-28 03:03:59,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {111028#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111029#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:59,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {111029#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111029#(<= main_~i~0 14)} is VALID [2022-04-28 03:03:59,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {111029#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111030#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:59,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {111030#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111030#(<= main_~i~0 15)} is VALID [2022-04-28 03:03:59,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {111030#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111031#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:59,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {111031#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111031#(<= main_~i~0 16)} is VALID [2022-04-28 03:03:59,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {111031#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111032#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:59,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {111032#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111032#(<= main_~i~0 17)} is VALID [2022-04-28 03:03:59,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {111032#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111033#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:59,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {111033#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111033#(<= main_~i~0 18)} is VALID [2022-04-28 03:03:59,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {111033#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111034#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:59,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {111034#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111034#(<= main_~i~0 19)} is VALID [2022-04-28 03:03:59,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {111034#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111035#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:59,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {111035#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111035#(<= main_~i~0 20)} is VALID [2022-04-28 03:03:59,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {111035#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111036#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:59,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {111036#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111036#(<= main_~i~0 21)} is VALID [2022-04-28 03:03:59,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {111036#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111037#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:59,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {111037#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111037#(<= main_~i~0 22)} is VALID [2022-04-28 03:03:59,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {111037#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111038#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:59,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {111038#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111038#(<= main_~i~0 23)} is VALID [2022-04-28 03:03:59,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {111038#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111039#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:59,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {111039#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111039#(<= main_~i~0 24)} is VALID [2022-04-28 03:03:59,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {111039#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111040#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:59,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {111040#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111040#(<= main_~i~0 25)} is VALID [2022-04-28 03:03:59,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {111040#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111041#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:59,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {111041#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111041#(<= main_~i~0 26)} is VALID [2022-04-28 03:03:59,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {111041#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111042#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:59,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {111042#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111042#(<= main_~i~0 27)} is VALID [2022-04-28 03:03:59,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {111042#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111043#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:59,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {111043#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111043#(<= main_~i~0 28)} is VALID [2022-04-28 03:03:59,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {111043#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111044#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:59,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {111044#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111044#(<= main_~i~0 29)} is VALID [2022-04-28 03:03:59,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {111044#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111045#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:59,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {111045#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111045#(<= main_~i~0 30)} is VALID [2022-04-28 03:03:59,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {111045#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111046#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:59,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {111046#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111046#(<= main_~i~0 31)} is VALID [2022-04-28 03:03:59,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {111046#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111047#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:59,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {111047#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111047#(<= main_~i~0 32)} is VALID [2022-04-28 03:03:59,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {111047#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111048#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:59,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {111048#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111048#(<= main_~i~0 33)} is VALID [2022-04-28 03:03:59,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {111048#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111049#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:59,333 INFO L290 TraceCheckUtils]: 74: Hoare triple {111049#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111049#(<= main_~i~0 34)} is VALID [2022-04-28 03:03:59,333 INFO L290 TraceCheckUtils]: 75: Hoare triple {111049#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111050#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:59,333 INFO L290 TraceCheckUtils]: 76: Hoare triple {111050#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111050#(<= main_~i~0 35)} is VALID [2022-04-28 03:03:59,334 INFO L290 TraceCheckUtils]: 77: Hoare triple {111050#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111051#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:59,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {111051#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111051#(<= main_~i~0 36)} is VALID [2022-04-28 03:03:59,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {111051#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111052#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:59,335 INFO L290 TraceCheckUtils]: 80: Hoare triple {111052#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111052#(<= main_~i~0 37)} is VALID [2022-04-28 03:03:59,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {111052#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111053#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:59,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {111053#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111053#(<= main_~i~0 38)} is VALID [2022-04-28 03:03:59,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {111053#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111054#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:59,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {111054#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111054#(<= main_~i~0 39)} is VALID [2022-04-28 03:03:59,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {111054#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111055#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:59,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {111055#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111055#(<= main_~i~0 40)} is VALID [2022-04-28 03:03:59,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {111055#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111056#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:59,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {111056#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111056#(<= main_~i~0 41)} is VALID [2022-04-28 03:03:59,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {111056#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111057#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:59,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {111057#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111057#(<= main_~i~0 42)} is VALID [2022-04-28 03:03:59,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {111057#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111058#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:59,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {111058#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111058#(<= main_~i~0 43)} is VALID [2022-04-28 03:03:59,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {111058#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111059#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:59,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {111059#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111059#(<= main_~i~0 44)} is VALID [2022-04-28 03:03:59,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {111059#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111060#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:59,340 INFO L290 TraceCheckUtils]: 96: Hoare triple {111060#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111060#(<= main_~i~0 45)} is VALID [2022-04-28 03:03:59,340 INFO L290 TraceCheckUtils]: 97: Hoare triple {111060#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111061#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:59,340 INFO L290 TraceCheckUtils]: 98: Hoare triple {111061#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111061#(<= main_~i~0 46)} is VALID [2022-04-28 03:03:59,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {111061#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111062#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:59,341 INFO L290 TraceCheckUtils]: 100: Hoare triple {111062#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111062#(<= main_~i~0 47)} is VALID [2022-04-28 03:03:59,341 INFO L290 TraceCheckUtils]: 101: Hoare triple {111062#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111063#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:59,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {111063#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111063#(<= main_~i~0 48)} is VALID [2022-04-28 03:03:59,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {111063#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111064#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:59,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {111064#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111064#(<= main_~i~0 49)} is VALID [2022-04-28 03:03:59,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {111064#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111065#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:59,343 INFO L290 TraceCheckUtils]: 106: Hoare triple {111065#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111065#(<= main_~i~0 50)} is VALID [2022-04-28 03:03:59,343 INFO L290 TraceCheckUtils]: 107: Hoare triple {111065#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111066#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:59,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {111066#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111066#(<= main_~i~0 51)} is VALID [2022-04-28 03:03:59,344 INFO L290 TraceCheckUtils]: 109: Hoare triple {111066#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111067#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:59,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {111067#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111067#(<= main_~i~0 52)} is VALID [2022-04-28 03:03:59,345 INFO L290 TraceCheckUtils]: 111: Hoare triple {111067#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111068#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:59,345 INFO L290 TraceCheckUtils]: 112: Hoare triple {111068#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111068#(<= main_~i~0 53)} is VALID [2022-04-28 03:03:59,345 INFO L290 TraceCheckUtils]: 113: Hoare triple {111068#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111069#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:59,346 INFO L290 TraceCheckUtils]: 114: Hoare triple {111069#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111069#(<= main_~i~0 54)} is VALID [2022-04-28 03:03:59,346 INFO L290 TraceCheckUtils]: 115: Hoare triple {111069#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111070#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:59,346 INFO L290 TraceCheckUtils]: 116: Hoare triple {111070#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111070#(<= main_~i~0 55)} is VALID [2022-04-28 03:03:59,347 INFO L290 TraceCheckUtils]: 117: Hoare triple {111070#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111071#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:59,347 INFO L290 TraceCheckUtils]: 118: Hoare triple {111071#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111071#(<= main_~i~0 56)} is VALID [2022-04-28 03:03:59,347 INFO L290 TraceCheckUtils]: 119: Hoare triple {111071#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111072#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:59,347 INFO L290 TraceCheckUtils]: 120: Hoare triple {111072#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111072#(<= main_~i~0 57)} is VALID [2022-04-28 03:03:59,348 INFO L290 TraceCheckUtils]: 121: Hoare triple {111072#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111073#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:59,348 INFO L290 TraceCheckUtils]: 122: Hoare triple {111073#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111073#(<= main_~i~0 58)} is VALID [2022-04-28 03:03:59,349 INFO L290 TraceCheckUtils]: 123: Hoare triple {111073#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111074#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:59,349 INFO L290 TraceCheckUtils]: 124: Hoare triple {111074#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111074#(<= main_~i~0 59)} is VALID [2022-04-28 03:03:59,349 INFO L290 TraceCheckUtils]: 125: Hoare triple {111074#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111075#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:59,349 INFO L290 TraceCheckUtils]: 126: Hoare triple {111075#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111075#(<= main_~i~0 60)} is VALID [2022-04-28 03:03:59,350 INFO L290 TraceCheckUtils]: 127: Hoare triple {111075#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111076#(<= main_~i~0 61)} is VALID [2022-04-28 03:03:59,350 INFO L290 TraceCheckUtils]: 128: Hoare triple {111076#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111076#(<= main_~i~0 61)} is VALID [2022-04-28 03:03:59,350 INFO L290 TraceCheckUtils]: 129: Hoare triple {111076#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111077#(<= main_~i~0 62)} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 130: Hoare triple {111077#(<= main_~i~0 62)} assume !(~i~0 < 1024); {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 131: Hoare triple {111011#false} ~i~0 := 0; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 132: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 133: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 134: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 135: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 136: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 137: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 138: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 139: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-28 03:03:59,351 INFO L290 TraceCheckUtils]: 140: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L290 TraceCheckUtils]: 141: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L290 TraceCheckUtils]: 142: Hoare triple {111011#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L272 TraceCheckUtils]: 143: Hoare triple {111011#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L290 TraceCheckUtils]: 144: Hoare triple {111011#false} ~cond := #in~cond; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L290 TraceCheckUtils]: 145: Hoare triple {111011#false} assume 0 == ~cond; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-28 03:03:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:03:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504618425] [2022-04-28 03:03:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504618425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397763381] [2022-04-28 03:03:59,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:59,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:59,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:59,361 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:59,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 03:03:59,811 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:03:59,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:59,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:03:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:59,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:00,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-28 03:04:00,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#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(12, 2); {111010#true} is VALID [2022-04-28 03:04:00,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-28 03:04:00,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-28 03:04:00,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-28 03:04:00,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,116 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,118 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,119 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111475#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 132: Hoare triple {111475#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {111475#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:00,120 INFO L290 TraceCheckUtils]: 133: Hoare triple {111475#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111475#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:00,121 INFO L290 TraceCheckUtils]: 134: Hoare triple {111475#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111475#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:00,121 INFO L290 TraceCheckUtils]: 135: Hoare triple {111475#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:00,121 INFO L290 TraceCheckUtils]: 136: Hoare triple {111016#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:00,121 INFO L290 TraceCheckUtils]: 137: Hoare triple {111016#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:00,122 INFO L290 TraceCheckUtils]: 138: Hoare triple {111016#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111016#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:00,122 INFO L290 TraceCheckUtils]: 139: Hoare triple {111016#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:00,122 INFO L290 TraceCheckUtils]: 140: Hoare triple {111017#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:00,123 INFO L290 TraceCheckUtils]: 141: Hoare triple {111017#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:00,123 INFO L290 TraceCheckUtils]: 142: Hoare triple {111017#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111017#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:00,124 INFO L272 TraceCheckUtils]: 143: Hoare triple {111017#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:04:00,124 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:04:00,125 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-28 03:04:00,125 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-28 03:04:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-28 03:04:00,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:00,510 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-28 03:04:00,510 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-28 03:04:00,511 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:04:00,511 INFO L272 TraceCheckUtils]: 143: Hoare triple {111532#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:04:00,511 INFO L290 TraceCheckUtils]: 142: Hoare triple {111532#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111532#(<= main_~i~0 512)} is VALID [2022-04-28 03:04:00,512 INFO L290 TraceCheckUtils]: 141: Hoare triple {111532#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111532#(<= main_~i~0 512)} is VALID [2022-04-28 03:04:00,512 INFO L290 TraceCheckUtils]: 140: Hoare triple {111532#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {111532#(<= main_~i~0 512)} is VALID [2022-04-28 03:04:00,512 INFO L290 TraceCheckUtils]: 139: Hoare triple {111545#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111532#(<= main_~i~0 512)} is VALID [2022-04-28 03:04:00,512 INFO L290 TraceCheckUtils]: 138: Hoare triple {111545#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111545#(<= main_~i~0 511)} is VALID [2022-04-28 03:04:00,513 INFO L290 TraceCheckUtils]: 137: Hoare triple {111545#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111545#(<= main_~i~0 511)} is VALID [2022-04-28 03:04:00,513 INFO L290 TraceCheckUtils]: 136: Hoare triple {111545#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {111545#(<= main_~i~0 511)} is VALID [2022-04-28 03:04:00,513 INFO L290 TraceCheckUtils]: 135: Hoare triple {111558#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111545#(<= main_~i~0 511)} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 134: Hoare triple {111558#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111558#(<= main_~i~0 510)} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 133: Hoare triple {111558#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111558#(<= main_~i~0 510)} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 132: Hoare triple {111558#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {111558#(<= main_~i~0 510)} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111558#(<= main_~i~0 510)} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-28 03:04:00,514 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,515 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,516 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-28 03:04:00,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#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(12, 2); {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-28 03:04:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-28 03:04:00,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397763381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:00,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:00,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 7, 7] total 72 [2022-04-28 03:04:00,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:00,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313478480] [2022-04-28 03:04:00,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313478480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:00,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:04:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732915991] [2022-04-28 03:04:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 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 147 [2022-04-28 03:04:00,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:00,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:00,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:00,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:04:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:04:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=2760, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 03:04:00,611 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:15,389 INFO L93 Difference]: Finished difference Result 474 states and 604 transitions. [2022-04-28 03:04:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 03:04:15,389 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 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 147 [2022-04-28 03:04:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-28 03:04:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-28 03:04:15,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 595 transitions. [2022-04-28 03:04:15,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:15,831 INFO L225 Difference]: With dead ends: 474 [2022-04-28 03:04:15,831 INFO L226 Difference]: Without dead ends: 457 [2022-04-28 03:04:15,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6700, Invalid=11390, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 03:04:15,832 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1402 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:15,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 42 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:04:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-28 03:04:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 150. [2022-04-28 03:04:16,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:16,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:16,677 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:16,677 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:16,684 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-28 03:04:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-28 03:04:16,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:16,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:16,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-28 03:04:16,685 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 457 states. [2022-04-28 03:04:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:16,691 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-28 03:04:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-28 03:04:16,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:16,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:16,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:16,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2022-04-28 03:04:16,693 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 147 [2022-04-28 03:04:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:16,693 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2022-04-28 03:04:16,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:16,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 154 transitions. [2022-04-28 03:04:17,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-28 03:04:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 03:04:17,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:17,056 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:17,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-04-28 03:04:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:17,273 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 127 times [2022-04-28 03:04:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:17,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751928999] [2022-04-28 03:04:17,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:04:17,276 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:04:17,276 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:04:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 128 times [2022-04-28 03:04:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:17,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367515445] [2022-04-28 03:04:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:18,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {114323#(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(12, 2); {114254#true} is VALID [2022-04-28 03:04:18,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-28 03:04:18,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-28 03:04:18,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:18,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {114323#(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(12, 2); {114254#true} is VALID [2022-04-28 03:04:18,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-28 03:04:18,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-28 03:04:18,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-28 03:04:18,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114259#(= main_~i~0 0)} is VALID [2022-04-28 03:04:18,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {114259#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114259#(= main_~i~0 0)} is VALID [2022-04-28 03:04:18,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {114259#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:18,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:18,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:18,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:18,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:18,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:18,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:18,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:18,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:18,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:18,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:18,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:18,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:18,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:18,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:18,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:18,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:18,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:18,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:18,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:18,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:18,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:18,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:18,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:18,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:18,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:18,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:18,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:18,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:18,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:18,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:18,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:18,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:18,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:18,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:18,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:18,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:18,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:18,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:18,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:18,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:18,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:18,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:18,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:18,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:18,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:18,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:18,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:18,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:18,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:18,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:18,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:18,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:18,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:18,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:18,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:18,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:18,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:18,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:18,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:18,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:18,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:18,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:18,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:18,504 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:18,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:18,504 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:18,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:18,505 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:18,505 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:18,506 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:18,506 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:18,506 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:18,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:18,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:18,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:18,507 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:18,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:18,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:18,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:18,509 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:18,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:18,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:18,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:18,510 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:18,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:18,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:18,511 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:18,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:18,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:18,512 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:18,512 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:18,512 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:18,513 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:18,513 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:18,513 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:18,513 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:18,514 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:18,514 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:18,514 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:18,515 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:18,515 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:18,515 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:18,516 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:18,516 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:18,516 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:18,517 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:18,517 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:18,517 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:18,517 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:18,518 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:18,518 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:18,518 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:18,519 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:18,519 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:18,519 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:18,520 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:18,520 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:18,520 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:18,520 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:18,521 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:18,521 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:18,521 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:18,522 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:18,522 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:18,522 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-28 03:04:18,522 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-28 03:04:18,522 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-28 03:04:18,523 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-28 03:04:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:18,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367515445] [2022-04-28 03:04:18,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367515445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:18,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223271031] [2022-04-28 03:04:18,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:04:18,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:18,525 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:04:18,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 03:04:18,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:04:18,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:18,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 03:04:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:19,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:19,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-28 03:04:19,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#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(12, 2); {114254#true} is VALID [2022-04-28 03:04:19,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-28 03:04:19,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-28 03:04:19,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-28 03:04:19,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114342#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:19,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {114342#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114342#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:19,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {114342#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:19,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:19,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:19,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:19,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:19,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:19,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:19,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:19,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:19,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:19,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:19,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:19,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:19,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:19,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:19,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:19,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:19,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:19,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:19,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:19,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:19,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:19,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:19,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:19,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:19,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:19,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:19,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:19,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:19,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:19,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:19,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:19,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:19,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:19,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:19,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:19,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:19,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:19,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:19,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:19,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:19,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:19,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:19,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:19,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:19,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:19,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:19,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:19,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:19,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:19,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:19,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:19,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:19,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:19,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:19,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:19,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:19,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:19,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:19,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:19,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:19,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:19,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:19,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:19,769 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:19,769 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:19,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:19,770 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:19,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:19,770 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:19,771 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:19,771 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:19,771 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:19,771 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:19,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:19,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:19,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:19,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:19,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:19,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:19,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:19,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:19,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:19,774 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:19,774 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:19,774 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:19,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:19,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:19,775 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:19,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:19,776 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:19,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:19,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:19,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:19,777 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:19,777 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:19,777 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:19,777 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:19,778 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:19,778 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:19,778 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:19,779 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:19,779 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:19,779 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:19,779 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:19,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:19,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:19,780 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:19,780 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:19,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:19,781 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:19,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:19,781 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:19,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:19,782 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:19,782 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:19,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:19,783 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:19,783 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:19,783 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:19,783 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:19,784 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:19,784 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:19,784 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:19,785 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-28 03:04:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:19,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:23,006 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 132: Hoare triple {114820#(< main_~i~0 1024)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-28 03:04:23,007 INFO L290 TraceCheckUtils]: 131: Hoare triple {114824#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114820#(< main_~i~0 1024)} is VALID [2022-04-28 03:04:23,008 INFO L290 TraceCheckUtils]: 130: Hoare triple {114824#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114824#(< main_~i~0 1023)} is VALID [2022-04-28 03:04:23,008 INFO L290 TraceCheckUtils]: 129: Hoare triple {114831#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114824#(< main_~i~0 1023)} is VALID [2022-04-28 03:04:23,008 INFO L290 TraceCheckUtils]: 128: Hoare triple {114831#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114831#(< main_~i~0 1022)} is VALID [2022-04-28 03:04:23,008 INFO L290 TraceCheckUtils]: 127: Hoare triple {114838#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114831#(< main_~i~0 1022)} is VALID [2022-04-28 03:04:23,009 INFO L290 TraceCheckUtils]: 126: Hoare triple {114838#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114838#(< main_~i~0 1021)} is VALID [2022-04-28 03:04:23,009 INFO L290 TraceCheckUtils]: 125: Hoare triple {114845#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114838#(< main_~i~0 1021)} is VALID [2022-04-28 03:04:23,009 INFO L290 TraceCheckUtils]: 124: Hoare triple {114845#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114845#(< main_~i~0 1020)} is VALID [2022-04-28 03:04:23,009 INFO L290 TraceCheckUtils]: 123: Hoare triple {114852#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114845#(< main_~i~0 1020)} is VALID [2022-04-28 03:04:23,010 INFO L290 TraceCheckUtils]: 122: Hoare triple {114852#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114852#(< main_~i~0 1019)} is VALID [2022-04-28 03:04:23,010 INFO L290 TraceCheckUtils]: 121: Hoare triple {114859#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114852#(< main_~i~0 1019)} is VALID [2022-04-28 03:04:23,010 INFO L290 TraceCheckUtils]: 120: Hoare triple {114859#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114859#(< main_~i~0 1018)} is VALID [2022-04-28 03:04:23,010 INFO L290 TraceCheckUtils]: 119: Hoare triple {114866#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114859#(< main_~i~0 1018)} is VALID [2022-04-28 03:04:23,010 INFO L290 TraceCheckUtils]: 118: Hoare triple {114866#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114866#(< main_~i~0 1017)} is VALID [2022-04-28 03:04:23,011 INFO L290 TraceCheckUtils]: 117: Hoare triple {114873#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114866#(< main_~i~0 1017)} is VALID [2022-04-28 03:04:23,011 INFO L290 TraceCheckUtils]: 116: Hoare triple {114873#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114873#(< main_~i~0 1016)} is VALID [2022-04-28 03:04:23,011 INFO L290 TraceCheckUtils]: 115: Hoare triple {114880#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114873#(< main_~i~0 1016)} is VALID [2022-04-28 03:04:23,011 INFO L290 TraceCheckUtils]: 114: Hoare triple {114880#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114880#(< main_~i~0 1015)} is VALID [2022-04-28 03:04:23,012 INFO L290 TraceCheckUtils]: 113: Hoare triple {114887#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114880#(< main_~i~0 1015)} is VALID [2022-04-28 03:04:23,012 INFO L290 TraceCheckUtils]: 112: Hoare triple {114887#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114887#(< main_~i~0 1014)} is VALID [2022-04-28 03:04:23,012 INFO L290 TraceCheckUtils]: 111: Hoare triple {114894#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114887#(< main_~i~0 1014)} is VALID [2022-04-28 03:04:23,012 INFO L290 TraceCheckUtils]: 110: Hoare triple {114894#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114894#(< main_~i~0 1013)} is VALID [2022-04-28 03:04:23,012 INFO L290 TraceCheckUtils]: 109: Hoare triple {114901#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114894#(< main_~i~0 1013)} is VALID [2022-04-28 03:04:23,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {114901#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114901#(< main_~i~0 1012)} is VALID [2022-04-28 03:04:23,013 INFO L290 TraceCheckUtils]: 107: Hoare triple {114908#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114901#(< main_~i~0 1012)} is VALID [2022-04-28 03:04:23,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {114908#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114908#(< main_~i~0 1011)} is VALID [2022-04-28 03:04:23,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {114915#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114908#(< main_~i~0 1011)} is VALID [2022-04-28 03:04:23,014 INFO L290 TraceCheckUtils]: 104: Hoare triple {114915#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114915#(< main_~i~0 1010)} is VALID [2022-04-28 03:04:23,014 INFO L290 TraceCheckUtils]: 103: Hoare triple {114922#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114915#(< main_~i~0 1010)} is VALID [2022-04-28 03:04:23,014 INFO L290 TraceCheckUtils]: 102: Hoare triple {114922#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114922#(< main_~i~0 1009)} is VALID [2022-04-28 03:04:23,014 INFO L290 TraceCheckUtils]: 101: Hoare triple {114929#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114922#(< main_~i~0 1009)} is VALID [2022-04-28 03:04:23,014 INFO L290 TraceCheckUtils]: 100: Hoare triple {114929#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114929#(< main_~i~0 1008)} is VALID [2022-04-28 03:04:23,015 INFO L290 TraceCheckUtils]: 99: Hoare triple {114936#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114929#(< main_~i~0 1008)} is VALID [2022-04-28 03:04:23,015 INFO L290 TraceCheckUtils]: 98: Hoare triple {114936#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114936#(< main_~i~0 1007)} is VALID [2022-04-28 03:04:23,015 INFO L290 TraceCheckUtils]: 97: Hoare triple {114943#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114936#(< main_~i~0 1007)} is VALID [2022-04-28 03:04:23,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {114943#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114943#(< main_~i~0 1006)} is VALID [2022-04-28 03:04:23,016 INFO L290 TraceCheckUtils]: 95: Hoare triple {114950#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114943#(< main_~i~0 1006)} is VALID [2022-04-28 03:04:23,016 INFO L290 TraceCheckUtils]: 94: Hoare triple {114950#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114950#(< main_~i~0 1005)} is VALID [2022-04-28 03:04:23,016 INFO L290 TraceCheckUtils]: 93: Hoare triple {114957#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114950#(< main_~i~0 1005)} is VALID [2022-04-28 03:04:23,016 INFO L290 TraceCheckUtils]: 92: Hoare triple {114957#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114957#(< main_~i~0 1004)} is VALID [2022-04-28 03:04:23,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {114964#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114957#(< main_~i~0 1004)} is VALID [2022-04-28 03:04:23,017 INFO L290 TraceCheckUtils]: 90: Hoare triple {114964#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114964#(< main_~i~0 1003)} is VALID [2022-04-28 03:04:23,017 INFO L290 TraceCheckUtils]: 89: Hoare triple {114971#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114964#(< main_~i~0 1003)} is VALID [2022-04-28 03:04:23,017 INFO L290 TraceCheckUtils]: 88: Hoare triple {114971#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114971#(< main_~i~0 1002)} is VALID [2022-04-28 03:04:23,017 INFO L290 TraceCheckUtils]: 87: Hoare triple {114978#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114971#(< main_~i~0 1002)} is VALID [2022-04-28 03:04:23,018 INFO L290 TraceCheckUtils]: 86: Hoare triple {114978#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114978#(< main_~i~0 1001)} is VALID [2022-04-28 03:04:23,018 INFO L290 TraceCheckUtils]: 85: Hoare triple {114985#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114978#(< main_~i~0 1001)} is VALID [2022-04-28 03:04:23,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {114985#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114985#(< main_~i~0 1000)} is VALID [2022-04-28 03:04:23,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {114992#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114985#(< main_~i~0 1000)} is VALID [2022-04-28 03:04:23,019 INFO L290 TraceCheckUtils]: 82: Hoare triple {114992#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114992#(< main_~i~0 999)} is VALID [2022-04-28 03:04:23,019 INFO L290 TraceCheckUtils]: 81: Hoare triple {114999#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114992#(< main_~i~0 999)} is VALID [2022-04-28 03:04:23,019 INFO L290 TraceCheckUtils]: 80: Hoare triple {114999#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114999#(< main_~i~0 998)} is VALID [2022-04-28 03:04:23,019 INFO L290 TraceCheckUtils]: 79: Hoare triple {115006#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114999#(< main_~i~0 998)} is VALID [2022-04-28 03:04:23,019 INFO L290 TraceCheckUtils]: 78: Hoare triple {115006#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115006#(< main_~i~0 997)} is VALID [2022-04-28 03:04:23,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {115013#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115006#(< main_~i~0 997)} is VALID [2022-04-28 03:04:23,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {115013#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115013#(< main_~i~0 996)} is VALID [2022-04-28 03:04:23,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {115020#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115013#(< main_~i~0 996)} is VALID [2022-04-28 03:04:23,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {115020#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115020#(< main_~i~0 995)} is VALID [2022-04-28 03:04:23,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {115027#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115020#(< main_~i~0 995)} is VALID [2022-04-28 03:04:23,021 INFO L290 TraceCheckUtils]: 72: Hoare triple {115027#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115027#(< main_~i~0 994)} is VALID [2022-04-28 03:04:23,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {115034#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115027#(< main_~i~0 994)} is VALID [2022-04-28 03:04:23,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {115034#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115034#(< main_~i~0 993)} is VALID [2022-04-28 03:04:23,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {115041#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115034#(< main_~i~0 993)} is VALID [2022-04-28 03:04:23,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {115041#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115041#(< main_~i~0 992)} is VALID [2022-04-28 03:04:23,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {115048#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115041#(< main_~i~0 992)} is VALID [2022-04-28 03:04:23,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {115048#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115048#(< main_~i~0 991)} is VALID [2022-04-28 03:04:23,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {115055#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115048#(< main_~i~0 991)} is VALID [2022-04-28 03:04:23,023 INFO L290 TraceCheckUtils]: 64: Hoare triple {115055#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115055#(< main_~i~0 990)} is VALID [2022-04-28 03:04:23,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {115062#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115055#(< main_~i~0 990)} is VALID [2022-04-28 03:04:23,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {115062#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115062#(< main_~i~0 989)} is VALID [2022-04-28 03:04:23,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {115069#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115062#(< main_~i~0 989)} is VALID [2022-04-28 03:04:23,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {115069#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115069#(< main_~i~0 988)} is VALID [2022-04-28 03:04:23,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {115076#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115069#(< main_~i~0 988)} is VALID [2022-04-28 03:04:23,024 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115076#(< main_~i~0 987)} is VALID [2022-04-28 03:04:23,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {115083#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115076#(< main_~i~0 987)} is VALID [2022-04-28 03:04:23,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {115083#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115083#(< main_~i~0 986)} is VALID [2022-04-28 03:04:23,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {115090#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115083#(< main_~i~0 986)} is VALID [2022-04-28 03:04:23,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {115090#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115090#(< main_~i~0 985)} is VALID [2022-04-28 03:04:23,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {115097#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115090#(< main_~i~0 985)} is VALID [2022-04-28 03:04:23,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {115097#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115097#(< main_~i~0 984)} is VALID [2022-04-28 03:04:23,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {115104#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115097#(< main_~i~0 984)} is VALID [2022-04-28 03:04:23,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {115104#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115104#(< main_~i~0 983)} is VALID [2022-04-28 03:04:23,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {115111#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115104#(< main_~i~0 983)} is VALID [2022-04-28 03:04:23,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {115111#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115111#(< main_~i~0 982)} is VALID [2022-04-28 03:04:23,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {115118#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115111#(< main_~i~0 982)} is VALID [2022-04-28 03:04:23,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {115118#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115118#(< main_~i~0 981)} is VALID [2022-04-28 03:04:23,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {115125#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115118#(< main_~i~0 981)} is VALID [2022-04-28 03:04:23,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {115125#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115125#(< main_~i~0 980)} is VALID [2022-04-28 03:04:23,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {115132#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115125#(< main_~i~0 980)} is VALID [2022-04-28 03:04:23,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {115132#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115132#(< main_~i~0 979)} is VALID [2022-04-28 03:04:23,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {115139#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115132#(< main_~i~0 979)} is VALID [2022-04-28 03:04:23,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {115139#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115139#(< main_~i~0 978)} is VALID [2022-04-28 03:04:23,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {115146#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115139#(< main_~i~0 978)} is VALID [2022-04-28 03:04:23,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {115146#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115146#(< main_~i~0 977)} is VALID [2022-04-28 03:04:23,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {115153#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115146#(< main_~i~0 977)} is VALID [2022-04-28 03:04:23,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {115153#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115153#(< main_~i~0 976)} is VALID [2022-04-28 03:04:23,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {115160#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115153#(< main_~i~0 976)} is VALID [2022-04-28 03:04:23,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {115160#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115160#(< main_~i~0 975)} is VALID [2022-04-28 03:04:23,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {115167#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115160#(< main_~i~0 975)} is VALID [2022-04-28 03:04:23,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {115167#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115167#(< main_~i~0 974)} is VALID [2022-04-28 03:04:23,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {115174#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115167#(< main_~i~0 974)} is VALID [2022-04-28 03:04:23,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {115174#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115174#(< main_~i~0 973)} is VALID [2022-04-28 03:04:23,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {115181#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115174#(< main_~i~0 973)} is VALID [2022-04-28 03:04:23,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {115181#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115181#(< main_~i~0 972)} is VALID [2022-04-28 03:04:23,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {115188#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115181#(< main_~i~0 972)} is VALID [2022-04-28 03:04:23,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {115188#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115188#(< main_~i~0 971)} is VALID [2022-04-28 03:04:23,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {115195#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115188#(< main_~i~0 971)} is VALID [2022-04-28 03:04:23,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {115195#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115195#(< main_~i~0 970)} is VALID [2022-04-28 03:04:23,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {115202#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115195#(< main_~i~0 970)} is VALID [2022-04-28 03:04:23,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {115202#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115202#(< main_~i~0 969)} is VALID [2022-04-28 03:04:23,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {115209#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115202#(< main_~i~0 969)} is VALID [2022-04-28 03:04:23,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {115209#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115209#(< main_~i~0 968)} is VALID [2022-04-28 03:04:23,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {115216#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115209#(< main_~i~0 968)} is VALID [2022-04-28 03:04:23,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {115216#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115216#(< main_~i~0 967)} is VALID [2022-04-28 03:04:23,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {115223#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115216#(< main_~i~0 967)} is VALID [2022-04-28 03:04:23,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {115223#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115223#(< main_~i~0 966)} is VALID [2022-04-28 03:04:23,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {115230#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115223#(< main_~i~0 966)} is VALID [2022-04-28 03:04:23,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {115230#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115230#(< main_~i~0 965)} is VALID [2022-04-28 03:04:23,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {115237#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115230#(< main_~i~0 965)} is VALID [2022-04-28 03:04:23,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {115237#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115237#(< main_~i~0 964)} is VALID [2022-04-28 03:04:23,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {115244#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115237#(< main_~i~0 964)} is VALID [2022-04-28 03:04:23,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {115244#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115244#(< main_~i~0 963)} is VALID [2022-04-28 03:04:23,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {115251#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115244#(< main_~i~0 963)} is VALID [2022-04-28 03:04:23,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {115251#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115251#(< main_~i~0 962)} is VALID [2022-04-28 03:04:23,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {115258#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115251#(< main_~i~0 962)} is VALID [2022-04-28 03:04:23,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {115258#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115258#(< main_~i~0 961)} is VALID [2022-04-28 03:04:23,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {115258#(< main_~i~0 961)} is VALID [2022-04-28 03:04:23,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-28 03:04:23,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-28 03:04:23,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-28 03:04:23,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#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(12, 2); {114254#true} is VALID [2022-04-28 03:04:23,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-28 03:04:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:23,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223271031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:23,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:23,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-28 03:04:23,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:23,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751928999] [2022-04-28 03:04:23,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751928999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:23,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:23,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:04:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121916550] [2022-04-28 03:04:23,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 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 149 [2022-04-28 03:04:23,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:23,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:23,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:23,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:04:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:04:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 03:04:23,145 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:39,281 INFO L93 Difference]: Finished difference Result 481 states and 613 transitions. [2022-04-28 03:04:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:04:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 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 149 [2022-04-28 03:04:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-28 03:04:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-28 03:04:39,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 604 transitions. [2022-04-28 03:04:39,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:39,724 INFO L225 Difference]: With dead ends: 481 [2022-04-28 03:04:39,724 INFO L226 Difference]: Without dead ends: 464 [2022-04-28 03:04:39,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=16902, Invalid=21318, Unknown=0, NotChecked=0, Total=38220 [2022-04-28 03:04:39,727 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1526 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:39,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 47 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:04:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-04-28 03:04:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 152. [2022-04-28 03:04:41,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:41,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:41,036 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:41,036 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:41,043 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-28 03:04:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-28 03:04:41,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:41,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:41,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 464 states. [2022-04-28 03:04:41,044 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 464 states. [2022-04-28 03:04:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:41,050 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-28 03:04:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-28 03:04:41,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:41,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:41,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:41,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-28 03:04:41,052 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 149 [2022-04-28 03:04:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-28 03:04:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:41,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-28 03:04:41,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-28 03:04:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-28 03:04:41,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:41,447 INFO L195 NwaCegarLoop]: trace histogram [64, 64, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:41,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-28 03:04:41,664 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 129 times [2022-04-28 03:04:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:41,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499794590] [2022-04-28 03:04:41,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:04:41,667 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:04:41,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:04:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 130 times [2022-04-28 03:04:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:41,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203684743] [2022-04-28 03:04:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {117674#(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(12, 2); {117604#true} is VALID [2022-04-28 03:04:43,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-28 03:04:43,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-28 03:04:43,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:43,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {117674#(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(12, 2); {117604#true} is VALID [2022-04-28 03:04:43,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-28 03:04:43,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-28 03:04:43,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-28 03:04:43,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117609#(= main_~i~0 0)} is VALID [2022-04-28 03:04:43,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {117609#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117609#(= main_~i~0 0)} is VALID [2022-04-28 03:04:43,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {117609#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:43,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:43,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:43,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:43,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:43,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:43,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:43,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:43,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:43,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:43,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:43,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:43,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:43,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:43,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:43,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:43,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:43,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:43,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:43,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:43,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:43,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:43,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:43,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:43,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:43,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:43,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:43,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:43,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:43,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:43,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:43,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:43,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:43,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:43,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:43,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:43,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:43,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:43,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:43,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:43,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:43,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:43,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:43,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:43,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:43,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:43,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:43,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:43,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:43,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:43,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:43,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:43,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:43,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:43,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:43,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:43,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:43,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:43,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:43,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:43,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:43,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:43,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:43,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:43,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:43,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:43,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:43,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:43,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:43,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:43,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:43,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:43,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:43,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:43,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:43,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:43,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:43,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:43,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:43,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:43,167 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:43,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:43,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:43,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:43,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:43,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:43,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:43,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:43,170 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:43,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:43,170 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:43,171 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:43,171 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:43,171 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:43,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:43,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:43,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:43,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:43,173 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:43,173 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:43,173 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:43,173 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:43,174 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:43,174 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:43,174 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:43,174 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:43,175 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:43,175 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:43,175 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:43,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:43,176 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:43,176 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:43,177 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:43,177 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:43,177 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:43,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:43,178 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:43,178 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:43,178 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:43,178 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:43,179 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:43,179 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:43,179 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:43,180 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:43,180 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:43,180 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:43,181 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-28 03:04:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203684743] [2022-04-28 03:04:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203684743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316997287] [2022-04-28 03:04:43,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:04:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:43,184 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:04:43,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 03:04:43,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:04:43,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:43,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 03:04:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:44,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-28 03:04:44,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#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(12, 2); {117604#true} is VALID [2022-04-28 03:04:44,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-28 03:04:44,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-28 03:04:44,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-28 03:04:44,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117693#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:44,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {117693#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117693#(<= main_~i~0 0)} is VALID [2022-04-28 03:04:44,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {117693#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:44,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-28 03:04:44,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:44,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-28 03:04:44,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:44,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-28 03:04:44,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:44,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-28 03:04:44,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:44,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-28 03:04:44,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:44,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-28 03:04:44,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:44,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-28 03:04:44,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:44,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-28 03:04:44,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:44,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-28 03:04:44,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:44,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-28 03:04:44,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:44,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-28 03:04:44,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:44,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-28 03:04:44,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:44,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-28 03:04:44,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:44,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-28 03:04:44,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:44,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-28 03:04:44,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:44,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-28 03:04:44,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:44,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-28 03:04:44,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:44,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-28 03:04:44,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:44,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-28 03:04:44,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:44,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-28 03:04:44,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:44,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-28 03:04:44,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:44,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-28 03:04:44,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:44,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-28 03:04:44,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:44,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-28 03:04:44,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:44,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-28 03:04:44,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:44,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-28 03:04:44,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:44,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-28 03:04:44,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:44,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-28 03:04:44,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:44,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-28 03:04:44,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:44,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-28 03:04:44,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:44,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-28 03:04:44,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:44,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-28 03:04:44,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:44,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-28 03:04:44,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:44,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-28 03:04:44,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:44,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-28 03:04:44,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:44,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-28 03:04:44,673 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:44,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-28 03:04:44,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:44,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-28 03:04:44,675 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:44,675 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-28 03:04:44,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:44,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-28 03:04:44,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:44,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-28 03:04:44,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:44,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-28 03:04:44,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:44,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-28 03:04:44,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:44,678 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-28 03:04:44,679 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:44,679 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-28 03:04:44,679 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:44,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-28 03:04:44,680 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:44,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-28 03:04:44,681 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:44,681 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-28 03:04:44,681 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:44,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-28 03:04:44,682 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:44,682 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-28 03:04:44,683 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:44,683 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-28 03:04:44,683 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:44,684 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-28 03:04:44,684 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:44,684 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-28 03:04:44,685 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:44,685 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-28 03:04:44,685 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:44,686 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-28 03:04:44,686 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:44,686 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-28 03:04:44,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:44,687 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-28 03:04:44,687 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:44,688 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-28 03:04:44,688 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:44,688 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-28 03:04:44,689 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:44,689 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-28 03:04:44,689 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:44,690 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-28 03:04:44,690 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:44,690 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-28 03:04:44,691 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:44,691 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-28 03:04:44,691 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:44,692 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-28 03:04:44,693 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-28 03:04:44,693 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-28 03:04:44,693 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-28 03:04:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:44,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:47,668 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-28 03:04:47,669 INFO L290 TraceCheckUtils]: 134: Hoare triple {118177#(< main_~i~0 1024)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-28 03:04:47,670 INFO L290 TraceCheckUtils]: 133: Hoare triple {118181#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118177#(< main_~i~0 1024)} is VALID [2022-04-28 03:04:47,670 INFO L290 TraceCheckUtils]: 132: Hoare triple {118181#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118181#(< main_~i~0 1023)} is VALID [2022-04-28 03:04:47,670 INFO L290 TraceCheckUtils]: 131: Hoare triple {118188#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118181#(< main_~i~0 1023)} is VALID [2022-04-28 03:04:47,670 INFO L290 TraceCheckUtils]: 130: Hoare triple {118188#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118188#(< main_~i~0 1022)} is VALID [2022-04-28 03:04:47,671 INFO L290 TraceCheckUtils]: 129: Hoare triple {118195#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118188#(< main_~i~0 1022)} is VALID [2022-04-28 03:04:47,671 INFO L290 TraceCheckUtils]: 128: Hoare triple {118195#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118195#(< main_~i~0 1021)} is VALID [2022-04-28 03:04:47,671 INFO L290 TraceCheckUtils]: 127: Hoare triple {118202#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118195#(< main_~i~0 1021)} is VALID [2022-04-28 03:04:47,671 INFO L290 TraceCheckUtils]: 126: Hoare triple {118202#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118202#(< main_~i~0 1020)} is VALID [2022-04-28 03:04:47,671 INFO L290 TraceCheckUtils]: 125: Hoare triple {118209#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118202#(< main_~i~0 1020)} is VALID [2022-04-28 03:04:47,672 INFO L290 TraceCheckUtils]: 124: Hoare triple {118209#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118209#(< main_~i~0 1019)} is VALID [2022-04-28 03:04:47,672 INFO L290 TraceCheckUtils]: 123: Hoare triple {118216#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118209#(< main_~i~0 1019)} is VALID [2022-04-28 03:04:47,672 INFO L290 TraceCheckUtils]: 122: Hoare triple {118216#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118216#(< main_~i~0 1018)} is VALID [2022-04-28 03:04:47,672 INFO L290 TraceCheckUtils]: 121: Hoare triple {118223#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118216#(< main_~i~0 1018)} is VALID [2022-04-28 03:04:47,673 INFO L290 TraceCheckUtils]: 120: Hoare triple {118223#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118223#(< main_~i~0 1017)} is VALID [2022-04-28 03:04:47,673 INFO L290 TraceCheckUtils]: 119: Hoare triple {118230#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118223#(< main_~i~0 1017)} is VALID [2022-04-28 03:04:47,673 INFO L290 TraceCheckUtils]: 118: Hoare triple {118230#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118230#(< main_~i~0 1016)} is VALID [2022-04-28 03:04:47,673 INFO L290 TraceCheckUtils]: 117: Hoare triple {118237#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118230#(< main_~i~0 1016)} is VALID [2022-04-28 03:04:47,673 INFO L290 TraceCheckUtils]: 116: Hoare triple {118237#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118237#(< main_~i~0 1015)} is VALID [2022-04-28 03:04:47,674 INFO L290 TraceCheckUtils]: 115: Hoare triple {118244#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118237#(< main_~i~0 1015)} is VALID [2022-04-28 03:04:47,674 INFO L290 TraceCheckUtils]: 114: Hoare triple {118244#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118244#(< main_~i~0 1014)} is VALID [2022-04-28 03:04:47,674 INFO L290 TraceCheckUtils]: 113: Hoare triple {118251#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118244#(< main_~i~0 1014)} is VALID [2022-04-28 03:04:47,674 INFO L290 TraceCheckUtils]: 112: Hoare triple {118251#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118251#(< main_~i~0 1013)} is VALID [2022-04-28 03:04:47,675 INFO L290 TraceCheckUtils]: 111: Hoare triple {118258#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118251#(< main_~i~0 1013)} is VALID [2022-04-28 03:04:47,675 INFO L290 TraceCheckUtils]: 110: Hoare triple {118258#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118258#(< main_~i~0 1012)} is VALID [2022-04-28 03:04:47,675 INFO L290 TraceCheckUtils]: 109: Hoare triple {118265#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118258#(< main_~i~0 1012)} is VALID [2022-04-28 03:04:47,675 INFO L290 TraceCheckUtils]: 108: Hoare triple {118265#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118265#(< main_~i~0 1011)} is VALID [2022-04-28 03:04:47,676 INFO L290 TraceCheckUtils]: 107: Hoare triple {118272#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118265#(< main_~i~0 1011)} is VALID [2022-04-28 03:04:47,676 INFO L290 TraceCheckUtils]: 106: Hoare triple {118272#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118272#(< main_~i~0 1010)} is VALID [2022-04-28 03:04:47,676 INFO L290 TraceCheckUtils]: 105: Hoare triple {118279#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118272#(< main_~i~0 1010)} is VALID [2022-04-28 03:04:47,676 INFO L290 TraceCheckUtils]: 104: Hoare triple {118279#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118279#(< main_~i~0 1009)} is VALID [2022-04-28 03:04:47,677 INFO L290 TraceCheckUtils]: 103: Hoare triple {118286#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118279#(< main_~i~0 1009)} is VALID [2022-04-28 03:04:47,677 INFO L290 TraceCheckUtils]: 102: Hoare triple {118286#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118286#(< main_~i~0 1008)} is VALID [2022-04-28 03:04:47,677 INFO L290 TraceCheckUtils]: 101: Hoare triple {118293#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118286#(< main_~i~0 1008)} is VALID [2022-04-28 03:04:47,677 INFO L290 TraceCheckUtils]: 100: Hoare triple {118293#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118293#(< main_~i~0 1007)} is VALID [2022-04-28 03:04:47,678 INFO L290 TraceCheckUtils]: 99: Hoare triple {118300#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118293#(< main_~i~0 1007)} is VALID [2022-04-28 03:04:47,678 INFO L290 TraceCheckUtils]: 98: Hoare triple {118300#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118300#(< main_~i~0 1006)} is VALID [2022-04-28 03:04:47,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {118307#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118300#(< main_~i~0 1006)} is VALID [2022-04-28 03:04:47,678 INFO L290 TraceCheckUtils]: 96: Hoare triple {118307#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118307#(< main_~i~0 1005)} is VALID [2022-04-28 03:04:47,678 INFO L290 TraceCheckUtils]: 95: Hoare triple {118314#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118307#(< main_~i~0 1005)} is VALID [2022-04-28 03:04:47,679 INFO L290 TraceCheckUtils]: 94: Hoare triple {118314#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118314#(< main_~i~0 1004)} is VALID [2022-04-28 03:04:47,679 INFO L290 TraceCheckUtils]: 93: Hoare triple {118321#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118314#(< main_~i~0 1004)} is VALID [2022-04-28 03:04:47,679 INFO L290 TraceCheckUtils]: 92: Hoare triple {118321#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118321#(< main_~i~0 1003)} is VALID [2022-04-28 03:04:47,679 INFO L290 TraceCheckUtils]: 91: Hoare triple {118328#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118321#(< main_~i~0 1003)} is VALID [2022-04-28 03:04:47,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {118328#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118328#(< main_~i~0 1002)} is VALID [2022-04-28 03:04:47,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {118335#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118328#(< main_~i~0 1002)} is VALID [2022-04-28 03:04:47,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {118335#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118335#(< main_~i~0 1001)} is VALID [2022-04-28 03:04:47,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {118342#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118335#(< main_~i~0 1001)} is VALID [2022-04-28 03:04:47,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {118342#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118342#(< main_~i~0 1000)} is VALID [2022-04-28 03:04:47,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {118349#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118342#(< main_~i~0 1000)} is VALID [2022-04-28 03:04:47,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {118349#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118349#(< main_~i~0 999)} is VALID [2022-04-28 03:04:47,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {118356#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118349#(< main_~i~0 999)} is VALID [2022-04-28 03:04:47,681 INFO L290 TraceCheckUtils]: 82: Hoare triple {118356#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118356#(< main_~i~0 998)} is VALID [2022-04-28 03:04:47,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {118363#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118356#(< main_~i~0 998)} is VALID [2022-04-28 03:04:47,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {118363#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118363#(< main_~i~0 997)} is VALID [2022-04-28 03:04:47,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {118370#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118363#(< main_~i~0 997)} is VALID [2022-04-28 03:04:47,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {118370#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118370#(< main_~i~0 996)} is VALID [2022-04-28 03:04:47,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {118377#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118370#(< main_~i~0 996)} is VALID [2022-04-28 03:04:47,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {118377#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118377#(< main_~i~0 995)} is VALID [2022-04-28 03:04:47,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {118384#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118377#(< main_~i~0 995)} is VALID [2022-04-28 03:04:47,683 INFO L290 TraceCheckUtils]: 74: Hoare triple {118384#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118384#(< main_~i~0 994)} is VALID [2022-04-28 03:04:47,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {118391#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118384#(< main_~i~0 994)} is VALID [2022-04-28 03:04:47,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {118391#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118391#(< main_~i~0 993)} is VALID [2022-04-28 03:04:47,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {118398#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118391#(< main_~i~0 993)} is VALID [2022-04-28 03:04:47,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {118398#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118398#(< main_~i~0 992)} is VALID [2022-04-28 03:04:47,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {118405#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118398#(< main_~i~0 992)} is VALID [2022-04-28 03:04:47,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {118405#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118405#(< main_~i~0 991)} is VALID [2022-04-28 03:04:47,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {118412#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118405#(< main_~i~0 991)} is VALID [2022-04-28 03:04:47,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {118412#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118412#(< main_~i~0 990)} is VALID [2022-04-28 03:04:47,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {118419#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118412#(< main_~i~0 990)} is VALID [2022-04-28 03:04:47,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {118419#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118419#(< main_~i~0 989)} is VALID [2022-04-28 03:04:47,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {118426#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118419#(< main_~i~0 989)} is VALID [2022-04-28 03:04:47,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {118426#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118426#(< main_~i~0 988)} is VALID [2022-04-28 03:04:47,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {118433#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118426#(< main_~i~0 988)} is VALID [2022-04-28 03:04:47,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {118433#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118433#(< main_~i~0 987)} is VALID [2022-04-28 03:04:47,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {118440#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118433#(< main_~i~0 987)} is VALID [2022-04-28 03:04:47,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {118440#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118440#(< main_~i~0 986)} is VALID [2022-04-28 03:04:47,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {118447#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118440#(< main_~i~0 986)} is VALID [2022-04-28 03:04:47,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {118447#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118447#(< main_~i~0 985)} is VALID [2022-04-28 03:04:47,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {118454#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118447#(< main_~i~0 985)} is VALID [2022-04-28 03:04:47,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {118454#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118454#(< main_~i~0 984)} is VALID [2022-04-28 03:04:47,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {118461#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118454#(< main_~i~0 984)} is VALID [2022-04-28 03:04:47,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {118461#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118461#(< main_~i~0 983)} is VALID [2022-04-28 03:04:47,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {118468#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118461#(< main_~i~0 983)} is VALID [2022-04-28 03:04:47,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {118468#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118468#(< main_~i~0 982)} is VALID [2022-04-28 03:04:47,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {118475#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118468#(< main_~i~0 982)} is VALID [2022-04-28 03:04:47,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {118475#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118475#(< main_~i~0 981)} is VALID [2022-04-28 03:04:47,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {118482#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118475#(< main_~i~0 981)} is VALID [2022-04-28 03:04:47,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {118482#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118482#(< main_~i~0 980)} is VALID [2022-04-28 03:04:47,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {118489#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118482#(< main_~i~0 980)} is VALID [2022-04-28 03:04:47,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {118489#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118489#(< main_~i~0 979)} is VALID [2022-04-28 03:04:47,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {118496#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118489#(< main_~i~0 979)} is VALID [2022-04-28 03:04:47,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {118496#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118496#(< main_~i~0 978)} is VALID [2022-04-28 03:04:47,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {118503#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118496#(< main_~i~0 978)} is VALID [2022-04-28 03:04:47,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {118503#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118503#(< main_~i~0 977)} is VALID [2022-04-28 03:04:47,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {118510#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118503#(< main_~i~0 977)} is VALID [2022-04-28 03:04:47,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {118510#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118510#(< main_~i~0 976)} is VALID [2022-04-28 03:04:47,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {118517#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118510#(< main_~i~0 976)} is VALID [2022-04-28 03:04:47,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {118517#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118517#(< main_~i~0 975)} is VALID [2022-04-28 03:04:47,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {118524#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118517#(< main_~i~0 975)} is VALID [2022-04-28 03:04:47,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {118524#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118524#(< main_~i~0 974)} is VALID [2022-04-28 03:04:47,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {118531#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118524#(< main_~i~0 974)} is VALID [2022-04-28 03:04:47,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {118531#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118531#(< main_~i~0 973)} is VALID [2022-04-28 03:04:47,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {118538#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118531#(< main_~i~0 973)} is VALID [2022-04-28 03:04:47,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {118538#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118538#(< main_~i~0 972)} is VALID [2022-04-28 03:04:47,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {118545#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118538#(< main_~i~0 972)} is VALID [2022-04-28 03:04:47,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {118545#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118545#(< main_~i~0 971)} is VALID [2022-04-28 03:04:47,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {118552#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118545#(< main_~i~0 971)} is VALID [2022-04-28 03:04:47,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {118552#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118552#(< main_~i~0 970)} is VALID [2022-04-28 03:04:47,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {118559#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118552#(< main_~i~0 970)} is VALID [2022-04-28 03:04:47,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {118559#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118559#(< main_~i~0 969)} is VALID [2022-04-28 03:04:47,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {118566#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118559#(< main_~i~0 969)} is VALID [2022-04-28 03:04:47,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {118566#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118566#(< main_~i~0 968)} is VALID [2022-04-28 03:04:47,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {118573#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118566#(< main_~i~0 968)} is VALID [2022-04-28 03:04:47,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {118573#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118573#(< main_~i~0 967)} is VALID [2022-04-28 03:04:47,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {118580#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118573#(< main_~i~0 967)} is VALID [2022-04-28 03:04:47,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {118580#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118580#(< main_~i~0 966)} is VALID [2022-04-28 03:04:47,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {118587#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118580#(< main_~i~0 966)} is VALID [2022-04-28 03:04:47,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {118587#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118587#(< main_~i~0 965)} is VALID [2022-04-28 03:04:47,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {118594#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118587#(< main_~i~0 965)} is VALID [2022-04-28 03:04:47,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {118594#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118594#(< main_~i~0 964)} is VALID [2022-04-28 03:04:47,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {118601#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118594#(< main_~i~0 964)} is VALID [2022-04-28 03:04:47,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {118601#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118601#(< main_~i~0 963)} is VALID [2022-04-28 03:04:47,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {118608#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118601#(< main_~i~0 963)} is VALID [2022-04-28 03:04:47,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {118608#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118608#(< main_~i~0 962)} is VALID [2022-04-28 03:04:47,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {118615#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118608#(< main_~i~0 962)} is VALID [2022-04-28 03:04:47,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {118615#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118615#(< main_~i~0 961)} is VALID [2022-04-28 03:04:47,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {118622#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118615#(< main_~i~0 961)} is VALID [2022-04-28 03:04:47,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {118622#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118622#(< main_~i~0 960)} is VALID [2022-04-28 03:04:47,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {118622#(< main_~i~0 960)} is VALID [2022-04-28 03:04:47,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-28 03:04:47,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-28 03:04:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-28 03:04:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#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(12, 2); {117604#true} is VALID [2022-04-28 03:04:47,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-28 03:04:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:04:47,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316997287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:47,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:47,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-28 03:04:47,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:47,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499794590] [2022-04-28 03:04:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499794590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:47,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 03:04:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799202792] [2022-04-28 03:04:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 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 151 [2022-04-28 03:04:47,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:47,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:47,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:47,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 03:04:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 03:04:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2022-04-28 03:04:47,761 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:03,942 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2022-04-28 03:05:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-28 03:05:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 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 151 [2022-04-28 03:05:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-28 03:05:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-28 03:05:03,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 613 transitions. [2022-04-28 03:05:04,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:04,289 INFO L225 Difference]: With dead ends: 488 [2022-04-28 03:05:04,289 INFO L226 Difference]: Without dead ends: 471 [2022-04-28 03:05:04,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=17426, Invalid=21976, Unknown=0, NotChecked=0, Total=39402 [2022-04-28 03:05:04,292 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1630 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:04,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 32 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:05:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-28 03:05:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 154. [2022-04-28 03:05:05,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:05,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:05,281 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:05,281 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:05,288 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-28 03:05:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-28 03:05:05,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:05,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:05,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-28 03:05:05,289 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-28 03:05:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:05,295 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-28 03:05:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-28 03:05:05,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:05,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:05,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:05,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-04-28 03:05:05,297 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 151 [2022-04-28 03:05:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:05,298 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-04-28 03:05:05,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:05,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 158 transitions. [2022-04-28 03:05:05,695 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-28 03:05:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-28 03:05:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 03:05:05,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:05,696 INFO L195 NwaCegarLoop]: trace histogram [65, 65, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:05,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-28 03:05:05,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-28 03:05:05,909 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 131 times [2022-04-28 03:05:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:05,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183425134] [2022-04-28 03:05:05,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:05:05,922 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:05:05,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:05:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 132 times [2022-04-28 03:05:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054520066] [2022-04-28 03:05:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:07,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {121073#(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(12, 2); {121002#true} is VALID [2022-04-28 03:05:07,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-28 03:05:07,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-28 03:05:07,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:07,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {121073#(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(12, 2); {121002#true} is VALID [2022-04-28 03:05:07,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-28 03:05:07,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-28 03:05:07,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-28 03:05:07,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121007#(= main_~i~0 0)} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {121007#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121007#(= main_~i~0 0)} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {121007#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:07,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {121008#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:07,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {121008#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:07,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {121009#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:07,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {121009#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121010#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:07,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {121010#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121010#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:07,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {121010#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121011#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:07,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {121011#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121011#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:07,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {121011#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121012#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:07,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {121012#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121012#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:07,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {121012#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121013#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:07,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {121013#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121013#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:07,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {121013#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121014#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:07,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {121014#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121014#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:07,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {121014#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121015#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:07,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {121015#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121015#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:07,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {121015#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121016#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:07,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {121016#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121016#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:07,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {121016#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121017#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:07,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {121017#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121017#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:07,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {121017#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121018#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:07,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {121018#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121018#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:07,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {121018#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121019#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:07,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {121019#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121019#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:07,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {121019#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121020#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:07,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {121020#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121020#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:07,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {121020#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121021#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:07,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {121021#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121021#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:07,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {121021#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121022#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:07,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {121022#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121022#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:07,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {121022#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121023#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:07,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {121023#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121023#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:07,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {121023#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121024#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:07,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {121024#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121024#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:07,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {121024#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121025#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:07,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {121025#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121025#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:07,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {121025#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121026#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:07,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {121026#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121026#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:07,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {121026#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121027#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:07,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {121027#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121027#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:07,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {121027#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121028#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:07,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {121028#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121028#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:07,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {121028#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121029#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:07,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {121029#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121029#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:07,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {121029#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121030#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:07,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {121030#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121030#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:07,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {121030#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121031#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:07,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {121031#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121031#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:07,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {121031#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121032#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:07,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {121032#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121032#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:07,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {121032#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121033#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:07,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {121033#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121033#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:07,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {121033#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121034#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:07,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {121034#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121034#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:07,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {121034#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121035#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:07,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {121035#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121035#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:07,580 INFO L290 TraceCheckUtils]: 63: Hoare triple {121035#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121036#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:07,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {121036#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121036#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:07,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {121036#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121037#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:07,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {121037#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121037#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:07,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {121037#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121038#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:07,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {121038#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121038#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:07,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {121038#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121039#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:07,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {121039#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121039#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:07,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {121039#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121040#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:07,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {121040#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121040#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:07,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {121040#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121041#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:07,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {121041#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121041#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:07,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {121041#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121042#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:07,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {121042#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121042#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:07,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {121042#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121043#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:07,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {121043#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121043#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:07,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {121043#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121044#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:07,587 INFO L290 TraceCheckUtils]: 80: Hoare triple {121044#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121044#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:07,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {121044#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121045#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:07,588 INFO L290 TraceCheckUtils]: 82: Hoare triple {121045#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121045#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:07,588 INFO L290 TraceCheckUtils]: 83: Hoare triple {121045#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121046#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:07,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {121046#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121046#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:07,589 INFO L290 TraceCheckUtils]: 85: Hoare triple {121046#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121047#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:07,589 INFO L290 TraceCheckUtils]: 86: Hoare triple {121047#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121047#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:07,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {121047#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121048#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:07,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {121048#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121048#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:07,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {121048#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121049#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:07,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {121049#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121049#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:07,601 INFO L290 TraceCheckUtils]: 91: Hoare triple {121049#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121050#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:07,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {121050#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121050#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:07,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {121050#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121051#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:07,602 INFO L290 TraceCheckUtils]: 94: Hoare triple {121051#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121051#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:07,602 INFO L290 TraceCheckUtils]: 95: Hoare triple {121051#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121052#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:07,602 INFO L290 TraceCheckUtils]: 96: Hoare triple {121052#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121052#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:07,603 INFO L290 TraceCheckUtils]: 97: Hoare triple {121052#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121053#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:07,603 INFO L290 TraceCheckUtils]: 98: Hoare triple {121053#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121053#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:07,603 INFO L290 TraceCheckUtils]: 99: Hoare triple {121053#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121054#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:07,604 INFO L290 TraceCheckUtils]: 100: Hoare triple {121054#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121054#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:07,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {121054#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121055#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:07,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {121055#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121055#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:07,605 INFO L290 TraceCheckUtils]: 103: Hoare triple {121055#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121056#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:07,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {121056#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121056#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:07,606 INFO L290 TraceCheckUtils]: 105: Hoare triple {121056#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121057#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:07,606 INFO L290 TraceCheckUtils]: 106: Hoare triple {121057#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121057#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:07,606 INFO L290 TraceCheckUtils]: 107: Hoare triple {121057#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121058#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:07,607 INFO L290 TraceCheckUtils]: 108: Hoare triple {121058#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121058#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:07,607 INFO L290 TraceCheckUtils]: 109: Hoare triple {121058#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121059#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:07,607 INFO L290 TraceCheckUtils]: 110: Hoare triple {121059#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121059#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:07,608 INFO L290 TraceCheckUtils]: 111: Hoare triple {121059#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121060#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:07,608 INFO L290 TraceCheckUtils]: 112: Hoare triple {121060#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121060#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:07,608 INFO L290 TraceCheckUtils]: 113: Hoare triple {121060#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121061#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:07,609 INFO L290 TraceCheckUtils]: 114: Hoare triple {121061#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121061#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:07,609 INFO L290 TraceCheckUtils]: 115: Hoare triple {121061#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121062#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:07,609 INFO L290 TraceCheckUtils]: 116: Hoare triple {121062#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121062#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:07,610 INFO L290 TraceCheckUtils]: 117: Hoare triple {121062#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121063#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:07,610 INFO L290 TraceCheckUtils]: 118: Hoare triple {121063#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121063#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:07,611 INFO L290 TraceCheckUtils]: 119: Hoare triple {121063#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121064#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:07,611 INFO L290 TraceCheckUtils]: 120: Hoare triple {121064#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121064#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:07,611 INFO L290 TraceCheckUtils]: 121: Hoare triple {121064#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121065#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:07,612 INFO L290 TraceCheckUtils]: 122: Hoare triple {121065#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121065#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:07,612 INFO L290 TraceCheckUtils]: 123: Hoare triple {121065#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121066#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:07,612 INFO L290 TraceCheckUtils]: 124: Hoare triple {121066#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121066#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:07,613 INFO L290 TraceCheckUtils]: 125: Hoare triple {121066#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121067#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:07,613 INFO L290 TraceCheckUtils]: 126: Hoare triple {121067#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121067#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:07,614 INFO L290 TraceCheckUtils]: 127: Hoare triple {121067#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121068#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:07,614 INFO L290 TraceCheckUtils]: 128: Hoare triple {121068#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121068#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:07,614 INFO L290 TraceCheckUtils]: 129: Hoare triple {121068#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121069#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:07,615 INFO L290 TraceCheckUtils]: 130: Hoare triple {121069#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121069#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:07,615 INFO L290 TraceCheckUtils]: 131: Hoare triple {121069#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121070#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:07,615 INFO L290 TraceCheckUtils]: 132: Hoare triple {121070#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121070#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:07,616 INFO L290 TraceCheckUtils]: 133: Hoare triple {121070#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121071#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:07,616 INFO L290 TraceCheckUtils]: 134: Hoare triple {121071#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121071#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:07,616 INFO L290 TraceCheckUtils]: 135: Hoare triple {121071#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121072#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 136: Hoare triple {121072#(<= main_~i~0 65)} assume !(~i~0 < 1024); {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 137: Hoare triple {121003#false} ~i~0 := 0; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 138: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 139: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 140: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 141: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 142: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 143: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 144: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 145: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 146: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-28 03:05:07,617 INFO L290 TraceCheckUtils]: 147: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L290 TraceCheckUtils]: 148: Hoare triple {121003#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L272 TraceCheckUtils]: 149: Hoare triple {121003#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L290 TraceCheckUtils]: 150: Hoare triple {121003#false} ~cond := #in~cond; {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L290 TraceCheckUtils]: 151: Hoare triple {121003#false} assume 0 == ~cond; {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-28 03:05:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054520066] [2022-04-28 03:05:07,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054520066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433463421] [2022-04-28 03:05:07,619 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:05:07,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:07,620 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:07,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 03:05:08,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:05:08,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:08,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:05:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:08,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:08,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#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(12, 2); {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,415 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,416 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,417 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,418 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,419 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-28 03:05:08,419 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121488#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:08,419 INFO L290 TraceCheckUtils]: 138: Hoare triple {121488#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {121488#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:08,419 INFO L290 TraceCheckUtils]: 139: Hoare triple {121488#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121488#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:08,420 INFO L290 TraceCheckUtils]: 140: Hoare triple {121488#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121488#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:08,420 INFO L290 TraceCheckUtils]: 141: Hoare triple {121488#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:08,420 INFO L290 TraceCheckUtils]: 142: Hoare triple {121008#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:08,420 INFO L290 TraceCheckUtils]: 143: Hoare triple {121008#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:08,421 INFO L290 TraceCheckUtils]: 144: Hoare triple {121008#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121008#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:08,421 INFO L290 TraceCheckUtils]: 145: Hoare triple {121008#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:08,421 INFO L290 TraceCheckUtils]: 146: Hoare triple {121009#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:08,421 INFO L290 TraceCheckUtils]: 147: Hoare triple {121009#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:08,422 INFO L290 TraceCheckUtils]: 148: Hoare triple {121009#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121009#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:08,422 INFO L272 TraceCheckUtils]: 149: Hoare triple {121009#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:05:08,422 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:05:08,423 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-28 03:05:08,423 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-28 03:05:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-28 03:05:08,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:08,717 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-28 03:05:08,718 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-28 03:05:08,718 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:05:08,719 INFO L272 TraceCheckUtils]: 149: Hoare triple {121545#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:05:08,719 INFO L290 TraceCheckUtils]: 148: Hoare triple {121545#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121545#(<= main_~i~0 512)} is VALID [2022-04-28 03:05:08,719 INFO L290 TraceCheckUtils]: 147: Hoare triple {121545#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121545#(<= main_~i~0 512)} is VALID [2022-04-28 03:05:08,719 INFO L290 TraceCheckUtils]: 146: Hoare triple {121545#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {121545#(<= main_~i~0 512)} is VALID [2022-04-28 03:05:08,720 INFO L290 TraceCheckUtils]: 145: Hoare triple {121558#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121545#(<= main_~i~0 512)} is VALID [2022-04-28 03:05:08,720 INFO L290 TraceCheckUtils]: 144: Hoare triple {121558#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121558#(<= main_~i~0 511)} is VALID [2022-04-28 03:05:08,720 INFO L290 TraceCheckUtils]: 143: Hoare triple {121558#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121558#(<= main_~i~0 511)} is VALID [2022-04-28 03:05:08,720 INFO L290 TraceCheckUtils]: 142: Hoare triple {121558#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {121558#(<= main_~i~0 511)} is VALID [2022-04-28 03:05:08,721 INFO L290 TraceCheckUtils]: 141: Hoare triple {121571#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121558#(<= main_~i~0 511)} is VALID [2022-04-28 03:05:08,721 INFO L290 TraceCheckUtils]: 140: Hoare triple {121571#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121571#(<= main_~i~0 510)} is VALID [2022-04-28 03:05:08,721 INFO L290 TraceCheckUtils]: 139: Hoare triple {121571#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121571#(<= main_~i~0 510)} is VALID [2022-04-28 03:05:08,721 INFO L290 TraceCheckUtils]: 138: Hoare triple {121571#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {121571#(<= main_~i~0 510)} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121571#(<= main_~i~0 510)} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,722 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,723 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,725 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-28 03:05:08,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-28 03:05:08,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#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(12, 2); {121002#true} is VALID [2022-04-28 03:05:08,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-28 03:05:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-28 03:05:08,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433463421] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:08,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:08,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 75 [2022-04-28 03:05:08,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183425134] [2022-04-28 03:05:08,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183425134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:08,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:08,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:05:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349151275] [2022-04-28 03:05:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 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 153 [2022-04-28 03:05:08,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:08,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:08,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:08,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:05:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:05:08,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2562, Invalid=2988, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:05:08,799 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:24,952 INFO L93 Difference]: Finished difference Result 495 states and 631 transitions. [2022-04-28 03:05:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:05:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 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 153 [2022-04-28 03:05:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-28 03:05:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-28 03:05:24,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 622 transitions. [2022-04-28 03:05:25,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:25,406 INFO L225 Difference]: With dead ends: 495 [2022-04-28 03:05:25,406 INFO L226 Difference]: Without dead ends: 478 [2022-04-28 03:05:25,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7315, Invalid=12425, Unknown=0, NotChecked=0, Total=19740 [2022-04-28 03:05:25,407 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1808 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:25,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 32 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:05:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-28 03:05:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 156. [2022-04-28 03:05:26,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:26,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:26,718 INFO L74 IsIncluded]: Start isIncluded. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:26,718 INFO L87 Difference]: Start difference. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:26,725 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-28 03:05:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-28 03:05:26,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:26,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:26,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-28 03:05:26,725 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-28 03:05:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:26,732 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-28 03:05:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-28 03:05:26,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:26,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:26,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:26,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2022-04-28 03:05:26,734 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 153 [2022-04-28 03:05:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:26,734 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2022-04-28 03:05:26,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:26,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 160 transitions. [2022-04-28 03:05:27,182 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-28 03:05:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-28 03:05:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 03:05:27,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:27,183 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:27,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:27,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-28 03:05:27,401 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 133 times [2022-04-28 03:05:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:27,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [593665503] [2022-04-28 03:05:27,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:05:27,405 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:05:27,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:05:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 134 times [2022-04-28 03:05:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:27,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214330769] [2022-04-28 03:05:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:28,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {124459#(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(12, 2); {124387#true} is VALID [2022-04-28 03:05:28,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-28 03:05:28,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-28 03:05:28,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:28,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {124459#(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(12, 2); {124387#true} is VALID [2022-04-28 03:05:28,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-28 03:05:28,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-28 03:05:28,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-28 03:05:28,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124392#(= main_~i~0 0)} is VALID [2022-04-28 03:05:28,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {124392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124392#(= main_~i~0 0)} is VALID [2022-04-28 03:05:28,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {124392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:28,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:28,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:28,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:28,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:28,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:28,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:28,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:28,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:28,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:28,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:28,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:28,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:28,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:28,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:28,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:28,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:28,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:28,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:28,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:28,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:28,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:28,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:28,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:28,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:28,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:28,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:28,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:28,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:28,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:28,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:28,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:28,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:28,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:28,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:28,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:28,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:28,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:28,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:28,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:28,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:28,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:28,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:28,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:28,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:28,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:28,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:28,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:28,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:28,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:28,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:28,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:28,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:28,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:28,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:28,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:28,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:28,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:28,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:28,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:28,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:28,947 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:28,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:28,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:28,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:28,949 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:28,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:28,949 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:28,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:28,950 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:28,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:28,951 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:28,951 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:28,951 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:28,952 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:28,952 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:28,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:28,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:28,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:28,953 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:28,953 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:28,954 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:28,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:28,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:28,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:28,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:28,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:28,956 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:28,956 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:28,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:28,957 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:28,957 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:28,957 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:28,958 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:28,958 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:28,958 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:28,959 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:28,959 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:28,959 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:28,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:28,960 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:28,960 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:28,960 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:28,961 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:28,961 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:28,961 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:28,962 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:28,962 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:28,962 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:28,963 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:28,963 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:28,963 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:28,964 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:28,964 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:28,964 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:28,965 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:28,965 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:28,965 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:28,966 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:28,966 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:28,966 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:28,966 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:28,967 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:28,967 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:28,967 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:28,968 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:28,968 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:28,968 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:28,969 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:28,969 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:28,969 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:28,970 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-28 03:05:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:28,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214330769] [2022-04-28 03:05:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214330769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:28,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524146181] [2022-04-28 03:05:28,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:28,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:28,973 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:28,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 03:05:29,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:29,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:29,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 03:05:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:29,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:30,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124387#true} is VALID [2022-04-28 03:05:30,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#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(12, 2); {124387#true} is VALID [2022-04-28 03:05:30,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-28 03:05:30,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-28 03:05:30,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-28 03:05:30,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124478#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:30,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {124478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124478#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:30,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {124478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:30,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:30,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:30,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:30,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:30,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:30,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:30,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:30,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:30,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:30,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:30,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:30,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:30,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:30,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:30,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:30,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:30,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:30,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:30,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:30,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:30,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:30,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:30,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:30,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:30,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:30,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:30,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:30,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:30,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:30,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:30,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:30,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:30,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:30,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:30,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:30,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:30,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:30,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:30,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:30,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:30,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:30,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:30,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:30,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:30,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:30,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:30,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:30,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:30,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:30,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:30,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:30,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:30,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:30,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:30,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:30,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:30,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:30,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:30,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:30,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:30,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:30,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:30,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:30,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:30,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:30,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:30,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:30,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:30,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:30,357 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:30,357 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:30,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:30,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:30,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:30,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:30,359 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:30,359 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:30,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:30,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:30,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:30,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:30,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:30,361 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:30,361 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:30,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:30,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:30,362 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:30,363 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:30,363 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:30,363 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:30,364 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:30,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:30,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:30,365 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:30,365 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:30,365 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:30,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:30,366 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:30,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:30,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:30,367 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:30,367 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:30,368 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:30,368 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:30,368 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:30,369 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:30,369 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:30,369 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:30,369 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:30,370 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:30,370 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:30,371 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:30,371 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:30,371 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:30,371 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:30,372 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:30,372 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:30,373 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:30,373 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:30,373 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:30,373 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:30,374 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:30,374 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:30,374 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:30,375 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:30,375 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:30,375 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:30,376 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:30,376 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:30,376 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:30,377 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-28 03:05:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:30,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:34,076 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-28 03:05:34,076 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-28 03:05:34,076 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-28 03:05:34,076 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-28 03:05:34,076 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:34,076 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-28 03:05:34,077 INFO L290 TraceCheckUtils]: 138: Hoare triple {124974#(< main_~i~0 1024)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-28 03:05:34,078 INFO L290 TraceCheckUtils]: 137: Hoare triple {124978#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124974#(< main_~i~0 1024)} is VALID [2022-04-28 03:05:34,078 INFO L290 TraceCheckUtils]: 136: Hoare triple {124978#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124978#(< main_~i~0 1023)} is VALID [2022-04-28 03:05:34,078 INFO L290 TraceCheckUtils]: 135: Hoare triple {124985#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124978#(< main_~i~0 1023)} is VALID [2022-04-28 03:05:34,078 INFO L290 TraceCheckUtils]: 134: Hoare triple {124985#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124985#(< main_~i~0 1022)} is VALID [2022-04-28 03:05:34,079 INFO L290 TraceCheckUtils]: 133: Hoare triple {124992#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124985#(< main_~i~0 1022)} is VALID [2022-04-28 03:05:34,079 INFO L290 TraceCheckUtils]: 132: Hoare triple {124992#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124992#(< main_~i~0 1021)} is VALID [2022-04-28 03:05:34,079 INFO L290 TraceCheckUtils]: 131: Hoare triple {124999#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124992#(< main_~i~0 1021)} is VALID [2022-04-28 03:05:34,079 INFO L290 TraceCheckUtils]: 130: Hoare triple {124999#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124999#(< main_~i~0 1020)} is VALID [2022-04-28 03:05:34,080 INFO L290 TraceCheckUtils]: 129: Hoare triple {125006#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124999#(< main_~i~0 1020)} is VALID [2022-04-28 03:05:34,080 INFO L290 TraceCheckUtils]: 128: Hoare triple {125006#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125006#(< main_~i~0 1019)} is VALID [2022-04-28 03:05:34,080 INFO L290 TraceCheckUtils]: 127: Hoare triple {125013#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125006#(< main_~i~0 1019)} is VALID [2022-04-28 03:05:34,080 INFO L290 TraceCheckUtils]: 126: Hoare triple {125013#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125013#(< main_~i~0 1018)} is VALID [2022-04-28 03:05:34,081 INFO L290 TraceCheckUtils]: 125: Hoare triple {125020#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125013#(< main_~i~0 1018)} is VALID [2022-04-28 03:05:34,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {125020#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125020#(< main_~i~0 1017)} is VALID [2022-04-28 03:05:34,081 INFO L290 TraceCheckUtils]: 123: Hoare triple {125027#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125020#(< main_~i~0 1017)} is VALID [2022-04-28 03:05:34,081 INFO L290 TraceCheckUtils]: 122: Hoare triple {125027#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125027#(< main_~i~0 1016)} is VALID [2022-04-28 03:05:34,081 INFO L290 TraceCheckUtils]: 121: Hoare triple {125034#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125027#(< main_~i~0 1016)} is VALID [2022-04-28 03:05:34,082 INFO L290 TraceCheckUtils]: 120: Hoare triple {125034#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125034#(< main_~i~0 1015)} is VALID [2022-04-28 03:05:34,082 INFO L290 TraceCheckUtils]: 119: Hoare triple {125041#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125034#(< main_~i~0 1015)} is VALID [2022-04-28 03:05:34,082 INFO L290 TraceCheckUtils]: 118: Hoare triple {125041#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125041#(< main_~i~0 1014)} is VALID [2022-04-28 03:05:34,082 INFO L290 TraceCheckUtils]: 117: Hoare triple {125048#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125041#(< main_~i~0 1014)} is VALID [2022-04-28 03:05:34,083 INFO L290 TraceCheckUtils]: 116: Hoare triple {125048#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125048#(< main_~i~0 1013)} is VALID [2022-04-28 03:05:34,083 INFO L290 TraceCheckUtils]: 115: Hoare triple {125055#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125048#(< main_~i~0 1013)} is VALID [2022-04-28 03:05:34,083 INFO L290 TraceCheckUtils]: 114: Hoare triple {125055#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125055#(< main_~i~0 1012)} is VALID [2022-04-28 03:05:34,083 INFO L290 TraceCheckUtils]: 113: Hoare triple {125062#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125055#(< main_~i~0 1012)} is VALID [2022-04-28 03:05:34,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {125062#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125062#(< main_~i~0 1011)} is VALID [2022-04-28 03:05:34,084 INFO L290 TraceCheckUtils]: 111: Hoare triple {125069#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125062#(< main_~i~0 1011)} is VALID [2022-04-28 03:05:34,084 INFO L290 TraceCheckUtils]: 110: Hoare triple {125069#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125069#(< main_~i~0 1010)} is VALID [2022-04-28 03:05:34,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {125076#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125069#(< main_~i~0 1010)} is VALID [2022-04-28 03:05:34,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {125076#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125076#(< main_~i~0 1009)} is VALID [2022-04-28 03:05:34,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {125083#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125076#(< main_~i~0 1009)} is VALID [2022-04-28 03:05:34,085 INFO L290 TraceCheckUtils]: 106: Hoare triple {125083#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125083#(< main_~i~0 1008)} is VALID [2022-04-28 03:05:34,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {125090#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125083#(< main_~i~0 1008)} is VALID [2022-04-28 03:05:34,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {125090#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125090#(< main_~i~0 1007)} is VALID [2022-04-28 03:05:34,086 INFO L290 TraceCheckUtils]: 103: Hoare triple {125097#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125090#(< main_~i~0 1007)} is VALID [2022-04-28 03:05:34,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {125097#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125097#(< main_~i~0 1006)} is VALID [2022-04-28 03:05:34,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {125104#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125097#(< main_~i~0 1006)} is VALID [2022-04-28 03:05:34,086 INFO L290 TraceCheckUtils]: 100: Hoare triple {125104#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125104#(< main_~i~0 1005)} is VALID [2022-04-28 03:05:34,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {125111#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125104#(< main_~i~0 1005)} is VALID [2022-04-28 03:05:34,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {125111#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125111#(< main_~i~0 1004)} is VALID [2022-04-28 03:05:34,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {125118#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125111#(< main_~i~0 1004)} is VALID [2022-04-28 03:05:34,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {125118#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125118#(< main_~i~0 1003)} is VALID [2022-04-28 03:05:34,087 INFO L290 TraceCheckUtils]: 95: Hoare triple {125125#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125118#(< main_~i~0 1003)} is VALID [2022-04-28 03:05:34,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {125125#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125125#(< main_~i~0 1002)} is VALID [2022-04-28 03:05:34,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {125132#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125125#(< main_~i~0 1002)} is VALID [2022-04-28 03:05:34,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {125132#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125132#(< main_~i~0 1001)} is VALID [2022-04-28 03:05:34,088 INFO L290 TraceCheckUtils]: 91: Hoare triple {125139#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125132#(< main_~i~0 1001)} is VALID [2022-04-28 03:05:34,088 INFO L290 TraceCheckUtils]: 90: Hoare triple {125139#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125139#(< main_~i~0 1000)} is VALID [2022-04-28 03:05:34,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {125146#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125139#(< main_~i~0 1000)} is VALID [2022-04-28 03:05:34,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {125146#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125146#(< main_~i~0 999)} is VALID [2022-04-28 03:05:34,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {125153#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125146#(< main_~i~0 999)} is VALID [2022-04-28 03:05:34,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {125153#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125153#(< main_~i~0 998)} is VALID [2022-04-28 03:05:34,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {125160#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125153#(< main_~i~0 998)} is VALID [2022-04-28 03:05:34,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {125160#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125160#(< main_~i~0 997)} is VALID [2022-04-28 03:05:34,090 INFO L290 TraceCheckUtils]: 83: Hoare triple {125167#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125160#(< main_~i~0 997)} is VALID [2022-04-28 03:05:34,090 INFO L290 TraceCheckUtils]: 82: Hoare triple {125167#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125167#(< main_~i~0 996)} is VALID [2022-04-28 03:05:34,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {125174#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125167#(< main_~i~0 996)} is VALID [2022-04-28 03:05:34,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {125174#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125174#(< main_~i~0 995)} is VALID [2022-04-28 03:05:34,091 INFO L290 TraceCheckUtils]: 79: Hoare triple {125181#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125174#(< main_~i~0 995)} is VALID [2022-04-28 03:05:34,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {125181#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125181#(< main_~i~0 994)} is VALID [2022-04-28 03:05:34,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {125188#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125181#(< main_~i~0 994)} is VALID [2022-04-28 03:05:34,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {125188#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125188#(< main_~i~0 993)} is VALID [2022-04-28 03:05:34,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {125195#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125188#(< main_~i~0 993)} is VALID [2022-04-28 03:05:34,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {125195#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125195#(< main_~i~0 992)} is VALID [2022-04-28 03:05:34,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {125202#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125195#(< main_~i~0 992)} is VALID [2022-04-28 03:05:34,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {125202#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125202#(< main_~i~0 991)} is VALID [2022-04-28 03:05:34,093 INFO L290 TraceCheckUtils]: 71: Hoare triple {125209#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125202#(< main_~i~0 991)} is VALID [2022-04-28 03:05:34,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {125209#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125209#(< main_~i~0 990)} is VALID [2022-04-28 03:05:34,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {125216#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125209#(< main_~i~0 990)} is VALID [2022-04-28 03:05:34,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {125216#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125216#(< main_~i~0 989)} is VALID [2022-04-28 03:05:34,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {125223#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125216#(< main_~i~0 989)} is VALID [2022-04-28 03:05:34,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {125223#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125223#(< main_~i~0 988)} is VALID [2022-04-28 03:05:34,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {125230#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125223#(< main_~i~0 988)} is VALID [2022-04-28 03:05:34,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {125230#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125230#(< main_~i~0 987)} is VALID [2022-04-28 03:05:34,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {125237#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125230#(< main_~i~0 987)} is VALID [2022-04-28 03:05:34,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {125237#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125237#(< main_~i~0 986)} is VALID [2022-04-28 03:05:34,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {125244#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125237#(< main_~i~0 986)} is VALID [2022-04-28 03:05:34,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {125244#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125244#(< main_~i~0 985)} is VALID [2022-04-28 03:05:34,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {125251#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125244#(< main_~i~0 985)} is VALID [2022-04-28 03:05:34,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {125251#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125251#(< main_~i~0 984)} is VALID [2022-04-28 03:05:34,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {125258#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125251#(< main_~i~0 984)} is VALID [2022-04-28 03:05:34,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {125258#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125258#(< main_~i~0 983)} is VALID [2022-04-28 03:05:34,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {125265#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125258#(< main_~i~0 983)} is VALID [2022-04-28 03:05:34,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {125265#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125265#(< main_~i~0 982)} is VALID [2022-04-28 03:05:34,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {125272#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125265#(< main_~i~0 982)} is VALID [2022-04-28 03:05:34,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {125272#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125272#(< main_~i~0 981)} is VALID [2022-04-28 03:05:34,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {125279#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125272#(< main_~i~0 981)} is VALID [2022-04-28 03:05:34,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {125279#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125279#(< main_~i~0 980)} is VALID [2022-04-28 03:05:34,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {125286#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125279#(< main_~i~0 980)} is VALID [2022-04-28 03:05:34,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {125286#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125286#(< main_~i~0 979)} is VALID [2022-04-28 03:05:34,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {125293#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125286#(< main_~i~0 979)} is VALID [2022-04-28 03:05:34,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {125293#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125293#(< main_~i~0 978)} is VALID [2022-04-28 03:05:34,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {125300#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125293#(< main_~i~0 978)} is VALID [2022-04-28 03:05:34,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {125300#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125300#(< main_~i~0 977)} is VALID [2022-04-28 03:05:34,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {125307#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125300#(< main_~i~0 977)} is VALID [2022-04-28 03:05:34,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {125307#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125307#(< main_~i~0 976)} is VALID [2022-04-28 03:05:34,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {125314#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125307#(< main_~i~0 976)} is VALID [2022-04-28 03:05:34,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {125314#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125314#(< main_~i~0 975)} is VALID [2022-04-28 03:05:34,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {125321#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125314#(< main_~i~0 975)} is VALID [2022-04-28 03:05:34,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {125321#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125321#(< main_~i~0 974)} is VALID [2022-04-28 03:05:34,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {125328#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125321#(< main_~i~0 974)} is VALID [2022-04-28 03:05:34,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {125328#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125328#(< main_~i~0 973)} is VALID [2022-04-28 03:05:34,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {125335#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125328#(< main_~i~0 973)} is VALID [2022-04-28 03:05:34,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {125335#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125335#(< main_~i~0 972)} is VALID [2022-04-28 03:05:34,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {125342#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125335#(< main_~i~0 972)} is VALID [2022-04-28 03:05:34,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {125342#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125342#(< main_~i~0 971)} is VALID [2022-04-28 03:05:34,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {125349#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125342#(< main_~i~0 971)} is VALID [2022-04-28 03:05:34,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {125349#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125349#(< main_~i~0 970)} is VALID [2022-04-28 03:05:34,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {125356#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125349#(< main_~i~0 970)} is VALID [2022-04-28 03:05:34,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {125356#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125356#(< main_~i~0 969)} is VALID [2022-04-28 03:05:34,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {125363#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125356#(< main_~i~0 969)} is VALID [2022-04-28 03:05:34,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {125363#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125363#(< main_~i~0 968)} is VALID [2022-04-28 03:05:34,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {125370#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125363#(< main_~i~0 968)} is VALID [2022-04-28 03:05:34,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {125370#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125370#(< main_~i~0 967)} is VALID [2022-04-28 03:05:34,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {125377#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125370#(< main_~i~0 967)} is VALID [2022-04-28 03:05:34,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {125377#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125377#(< main_~i~0 966)} is VALID [2022-04-28 03:05:34,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {125384#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125377#(< main_~i~0 966)} is VALID [2022-04-28 03:05:34,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {125384#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125384#(< main_~i~0 965)} is VALID [2022-04-28 03:05:34,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {125391#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125384#(< main_~i~0 965)} is VALID [2022-04-28 03:05:34,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {125391#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125391#(< main_~i~0 964)} is VALID [2022-04-28 03:05:34,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {125398#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125391#(< main_~i~0 964)} is VALID [2022-04-28 03:05:34,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {125398#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125398#(< main_~i~0 963)} is VALID [2022-04-28 03:05:34,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {125405#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125398#(< main_~i~0 963)} is VALID [2022-04-28 03:05:34,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {125405#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125405#(< main_~i~0 962)} is VALID [2022-04-28 03:05:34,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {125412#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125405#(< main_~i~0 962)} is VALID [2022-04-28 03:05:34,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {125412#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125412#(< main_~i~0 961)} is VALID [2022-04-28 03:05:34,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {125419#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125412#(< main_~i~0 961)} is VALID [2022-04-28 03:05:34,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {125419#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125419#(< main_~i~0 960)} is VALID [2022-04-28 03:05:34,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {125426#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125419#(< main_~i~0 960)} is VALID [2022-04-28 03:05:34,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {125426#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125426#(< main_~i~0 959)} is VALID [2022-04-28 03:05:34,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {125433#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {125426#(< main_~i~0 959)} is VALID [2022-04-28 03:05:34,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {125433#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {125433#(< main_~i~0 958)} is VALID [2022-04-28 03:05:34,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {125433#(< main_~i~0 958)} is VALID [2022-04-28 03:05:34,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-28 03:05:34,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-28 03:05:34,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-28 03:05:34,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#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(12, 2); {124387#true} is VALID [2022-04-28 03:05:34,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124387#true} is VALID [2022-04-28 03:05:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524146181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:34,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:34,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-28 03:05:34,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [593665503] [2022-04-28 03:05:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [593665503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:34,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:34,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 03:05:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655070483] [2022-04-28 03:05:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 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 155 [2022-04-28 03:05:34,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:34,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:34,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 03:05:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 03:05:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2022-04-28 03:05:34,171 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:52,362 INFO L93 Difference]: Finished difference Result 502 states and 640 transitions. [2022-04-28 03:05:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 03:05:52,362 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 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 155 [2022-04-28 03:05:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 631 transitions. [2022-04-28 03:05:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 631 transitions. [2022-04-28 03:05:52,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 631 transitions. [2022-04-28 03:05:52,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:52,705 INFO L225 Difference]: With dead ends: 502 [2022-04-28 03:05:52,705 INFO L226 Difference]: Without dead ends: 485 [2022-04-28 03:05:52,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=18498, Invalid=23322, Unknown=0, NotChecked=0, Total=41820 [2022-04-28 03:05:52,708 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1554 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:52,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 62 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:05:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-04-28 03:05:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 158. [2022-04-28 03:05:53,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:53,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:53,927 INFO L74 IsIncluded]: Start isIncluded. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:53,927 INFO L87 Difference]: Start difference. First operand 485 states. Second operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:53,934 INFO L93 Difference]: Finished difference Result 485 states and 619 transitions. [2022-04-28 03:05:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2022-04-28 03:05:53,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:53,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:53,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 485 states. [2022-04-28 03:05:53,935 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 485 states. [2022-04-28 03:05:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:53,941 INFO L93 Difference]: Finished difference Result 485 states and 619 transitions. [2022-04-28 03:05:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2022-04-28 03:05:53,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:53,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:53,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:53,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2022-04-28 03:05:53,943 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 155 [2022-04-28 03:05:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:53,944 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2022-04-28 03:05:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 69 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:53,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 162 transitions. [2022-04-28 03:05:54,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2022-04-28 03:05:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 03:05:54,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:54,358 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:54,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 03:05:54,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-28 03:05:54,559 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1264850071, now seen corresponding path program 135 times [2022-04-28 03:05:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:54,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654068468] [2022-04-28 03:05:54,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:05:54,565 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:05:54,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:05:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1264850071, now seen corresponding path program 136 times [2022-04-28 03:05:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:54,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190119036] [2022-04-28 03:05:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:55,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {127954#(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(12, 2); {127881#true} is VALID [2022-04-28 03:05:55,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-28 03:05:55,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-28 03:05:55,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:55,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {127954#(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(12, 2); {127881#true} is VALID [2022-04-28 03:05:55,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-28 03:05:55,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-28 03:05:55,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-28 03:05:55,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {127886#(= main_~i~0 0)} is VALID [2022-04-28 03:05:55,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {127886#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127886#(= main_~i~0 0)} is VALID [2022-04-28 03:05:55,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {127886#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127887#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:55,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {127887#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127887#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:55,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {127887#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127888#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:55,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {127888#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127888#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:55,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {127888#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127889#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:55,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {127889#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127889#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:55,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {127889#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127890#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:55,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {127890#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127890#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:55,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {127890#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127891#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:55,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {127891#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127891#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:55,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {127891#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127892#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:55,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {127892#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127892#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:55,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {127892#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127893#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:55,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {127893#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127893#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:55,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {127893#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127894#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:55,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {127894#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127894#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:55,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {127894#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127895#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:55,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {127895#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127895#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:55,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {127895#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127896#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:55,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {127896#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127896#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:55,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {127896#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127897#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:55,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {127897#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127897#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:55,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {127897#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127898#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:55,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {127898#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127898#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:55,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {127898#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127899#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:55,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {127899#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127899#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:55,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {127899#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127900#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:55,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {127900#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127900#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:55,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {127900#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127901#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:55,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {127901#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127901#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:55,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {127901#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127902#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:55,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {127902#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127902#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:55,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {127902#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127903#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:55,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {127903#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127903#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:55,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {127903#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127904#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:55,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {127904#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127904#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:55,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {127904#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127905#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:55,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {127905#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127905#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:55,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {127905#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127906#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:55,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {127906#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127906#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:55,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {127906#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127907#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:55,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {127907#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127907#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:55,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {127907#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127908#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:55,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {127908#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127908#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:55,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {127908#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127909#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:55,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {127909#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127909#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:55,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {127909#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127910#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:55,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {127910#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127910#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:55,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {127910#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127911#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:55,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {127911#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127911#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:55,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {127911#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127912#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:55,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {127912#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127912#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:55,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {127912#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127913#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:55,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {127913#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127913#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:55,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {127913#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127914#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:55,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {127914#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127914#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:55,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {127914#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127915#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:55,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {127915#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127915#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:55,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {127915#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127916#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:55,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {127916#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127916#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:55,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {127916#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127917#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:55,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {127917#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127917#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:55,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {127917#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127918#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:55,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {127918#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127918#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:55,588 INFO L290 TraceCheckUtils]: 71: Hoare triple {127918#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127919#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:55,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {127919#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127919#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:55,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {127919#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127920#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:55,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {127920#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127920#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:55,589 INFO L290 TraceCheckUtils]: 75: Hoare triple {127920#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127921#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:55,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {127921#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127921#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:55,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {127921#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127922#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:55,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {127922#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127922#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:55,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {127922#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127923#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:55,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {127923#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127923#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:55,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {127923#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127924#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:55,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {127924#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127924#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:55,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {127924#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127925#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:55,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {127925#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127925#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:55,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {127925#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127926#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:55,592 INFO L290 TraceCheckUtils]: 86: Hoare triple {127926#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127926#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:55,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {127926#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127927#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:55,592 INFO L290 TraceCheckUtils]: 88: Hoare triple {127927#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127927#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:55,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {127927#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127928#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:55,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {127928#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127928#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:55,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {127928#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127929#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:55,593 INFO L290 TraceCheckUtils]: 92: Hoare triple {127929#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127929#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:55,593 INFO L290 TraceCheckUtils]: 93: Hoare triple {127929#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127930#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:55,593 INFO L290 TraceCheckUtils]: 94: Hoare triple {127930#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127930#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:55,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {127930#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127931#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:55,594 INFO L290 TraceCheckUtils]: 96: Hoare triple {127931#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127931#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:55,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {127931#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127932#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:55,594 INFO L290 TraceCheckUtils]: 98: Hoare triple {127932#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127932#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:55,594 INFO L290 TraceCheckUtils]: 99: Hoare triple {127932#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127933#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:55,595 INFO L290 TraceCheckUtils]: 100: Hoare triple {127933#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127933#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:55,595 INFO L290 TraceCheckUtils]: 101: Hoare triple {127933#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127934#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:55,595 INFO L290 TraceCheckUtils]: 102: Hoare triple {127934#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127934#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:55,595 INFO L290 TraceCheckUtils]: 103: Hoare triple {127934#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127935#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:55,596 INFO L290 TraceCheckUtils]: 104: Hoare triple {127935#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127935#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:55,596 INFO L290 TraceCheckUtils]: 105: Hoare triple {127935#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127936#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:55,596 INFO L290 TraceCheckUtils]: 106: Hoare triple {127936#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127936#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:55,596 INFO L290 TraceCheckUtils]: 107: Hoare triple {127936#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127937#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:55,596 INFO L290 TraceCheckUtils]: 108: Hoare triple {127937#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127937#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:55,597 INFO L290 TraceCheckUtils]: 109: Hoare triple {127937#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127938#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:55,597 INFO L290 TraceCheckUtils]: 110: Hoare triple {127938#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127938#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:55,597 INFO L290 TraceCheckUtils]: 111: Hoare triple {127938#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127939#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:55,597 INFO L290 TraceCheckUtils]: 112: Hoare triple {127939#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127939#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:55,597 INFO L290 TraceCheckUtils]: 113: Hoare triple {127939#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127940#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:55,598 INFO L290 TraceCheckUtils]: 114: Hoare triple {127940#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127940#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:55,598 INFO L290 TraceCheckUtils]: 115: Hoare triple {127940#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127941#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:55,598 INFO L290 TraceCheckUtils]: 116: Hoare triple {127941#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127941#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:55,598 INFO L290 TraceCheckUtils]: 117: Hoare triple {127941#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127942#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:55,599 INFO L290 TraceCheckUtils]: 118: Hoare triple {127942#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127942#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:55,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {127942#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127943#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:55,599 INFO L290 TraceCheckUtils]: 120: Hoare triple {127943#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127943#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:55,599 INFO L290 TraceCheckUtils]: 121: Hoare triple {127943#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127944#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:55,599 INFO L290 TraceCheckUtils]: 122: Hoare triple {127944#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127944#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:55,600 INFO L290 TraceCheckUtils]: 123: Hoare triple {127944#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127945#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:55,600 INFO L290 TraceCheckUtils]: 124: Hoare triple {127945#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127945#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:55,600 INFO L290 TraceCheckUtils]: 125: Hoare triple {127945#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127946#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:55,600 INFO L290 TraceCheckUtils]: 126: Hoare triple {127946#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127946#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:55,601 INFO L290 TraceCheckUtils]: 127: Hoare triple {127946#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127947#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:55,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {127947#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127947#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:55,601 INFO L290 TraceCheckUtils]: 129: Hoare triple {127947#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127948#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:55,601 INFO L290 TraceCheckUtils]: 130: Hoare triple {127948#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127948#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:55,601 INFO L290 TraceCheckUtils]: 131: Hoare triple {127948#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127949#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:55,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {127949#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127949#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:55,602 INFO L290 TraceCheckUtils]: 133: Hoare triple {127949#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127950#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:55,602 INFO L290 TraceCheckUtils]: 134: Hoare triple {127950#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127950#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:55,602 INFO L290 TraceCheckUtils]: 135: Hoare triple {127950#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127951#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:55,603 INFO L290 TraceCheckUtils]: 136: Hoare triple {127951#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127951#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:55,603 INFO L290 TraceCheckUtils]: 137: Hoare triple {127951#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127952#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:55,603 INFO L290 TraceCheckUtils]: 138: Hoare triple {127952#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127952#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:55,603 INFO L290 TraceCheckUtils]: 139: Hoare triple {127952#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127953#(<= main_~i~0 67)} is VALID [2022-04-28 03:05:55,603 INFO L290 TraceCheckUtils]: 140: Hoare triple {127953#(<= main_~i~0 67)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-28 03:05:55,604 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-28 03:05:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:55,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190119036] [2022-04-28 03:05:55,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190119036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:55,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321886036] [2022-04-28 03:05:55,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:05:55,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:55,606 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:05:55,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-28 03:05:56,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:05:56,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:56,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 03:05:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:56,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:57,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127881#true} is VALID [2022-04-28 03:05:57,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#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(12, 2); {127881#true} is VALID [2022-04-28 03:05:57,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-28 03:05:57,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-28 03:05:57,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-28 03:05:57,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {127973#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:57,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {127973#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127973#(<= main_~i~0 0)} is VALID [2022-04-28 03:05:57,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {127973#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127887#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:57,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {127887#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127887#(<= main_~i~0 1)} is VALID [2022-04-28 03:05:57,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {127887#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127888#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:57,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {127888#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127888#(<= main_~i~0 2)} is VALID [2022-04-28 03:05:57,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {127888#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127889#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:57,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {127889#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127889#(<= main_~i~0 3)} is VALID [2022-04-28 03:05:57,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {127889#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127890#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:57,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {127890#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127890#(<= main_~i~0 4)} is VALID [2022-04-28 03:05:57,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {127890#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127891#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:57,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {127891#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127891#(<= main_~i~0 5)} is VALID [2022-04-28 03:05:57,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {127891#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127892#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:57,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {127892#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127892#(<= main_~i~0 6)} is VALID [2022-04-28 03:05:57,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {127892#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127893#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:57,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {127893#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127893#(<= main_~i~0 7)} is VALID [2022-04-28 03:05:57,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {127893#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127894#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:57,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {127894#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127894#(<= main_~i~0 8)} is VALID [2022-04-28 03:05:57,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {127894#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127895#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:57,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {127895#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127895#(<= main_~i~0 9)} is VALID [2022-04-28 03:05:57,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {127895#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127896#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:57,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {127896#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127896#(<= main_~i~0 10)} is VALID [2022-04-28 03:05:57,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {127896#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127897#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:57,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {127897#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127897#(<= main_~i~0 11)} is VALID [2022-04-28 03:05:57,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {127897#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127898#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:57,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {127898#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127898#(<= main_~i~0 12)} is VALID [2022-04-28 03:05:57,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {127898#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127899#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:57,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {127899#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127899#(<= main_~i~0 13)} is VALID [2022-04-28 03:05:57,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {127899#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127900#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:57,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {127900#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127900#(<= main_~i~0 14)} is VALID [2022-04-28 03:05:57,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {127900#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127901#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:57,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {127901#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127901#(<= main_~i~0 15)} is VALID [2022-04-28 03:05:57,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {127901#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127902#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:57,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {127902#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127902#(<= main_~i~0 16)} is VALID [2022-04-28 03:05:57,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {127902#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127903#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:57,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {127903#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127903#(<= main_~i~0 17)} is VALID [2022-04-28 03:05:57,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {127903#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127904#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:57,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {127904#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127904#(<= main_~i~0 18)} is VALID [2022-04-28 03:05:57,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {127904#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127905#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:57,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {127905#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127905#(<= main_~i~0 19)} is VALID [2022-04-28 03:05:57,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {127905#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127906#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:57,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {127906#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127906#(<= main_~i~0 20)} is VALID [2022-04-28 03:05:57,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {127906#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127907#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:57,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {127907#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127907#(<= main_~i~0 21)} is VALID [2022-04-28 03:05:57,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {127907#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127908#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:57,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {127908#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127908#(<= main_~i~0 22)} is VALID [2022-04-28 03:05:57,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {127908#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127909#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:57,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {127909#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127909#(<= main_~i~0 23)} is VALID [2022-04-28 03:05:57,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {127909#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127910#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:57,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {127910#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127910#(<= main_~i~0 24)} is VALID [2022-04-28 03:05:57,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {127910#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127911#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:57,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {127911#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127911#(<= main_~i~0 25)} is VALID [2022-04-28 03:05:57,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {127911#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127912#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:57,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {127912#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127912#(<= main_~i~0 26)} is VALID [2022-04-28 03:05:57,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {127912#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127913#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:57,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {127913#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127913#(<= main_~i~0 27)} is VALID [2022-04-28 03:05:57,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {127913#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127914#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:57,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {127914#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127914#(<= main_~i~0 28)} is VALID [2022-04-28 03:05:57,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {127914#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127915#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:57,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {127915#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127915#(<= main_~i~0 29)} is VALID [2022-04-28 03:05:57,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {127915#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127916#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:57,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {127916#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127916#(<= main_~i~0 30)} is VALID [2022-04-28 03:05:57,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {127916#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127917#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:57,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {127917#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127917#(<= main_~i~0 31)} is VALID [2022-04-28 03:05:57,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {127917#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127918#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:57,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {127918#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127918#(<= main_~i~0 32)} is VALID [2022-04-28 03:05:57,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {127918#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127919#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:57,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {127919#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127919#(<= main_~i~0 33)} is VALID [2022-04-28 03:05:57,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {127919#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127920#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:57,049 INFO L290 TraceCheckUtils]: 74: Hoare triple {127920#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127920#(<= main_~i~0 34)} is VALID [2022-04-28 03:05:57,049 INFO L290 TraceCheckUtils]: 75: Hoare triple {127920#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127921#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:57,049 INFO L290 TraceCheckUtils]: 76: Hoare triple {127921#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127921#(<= main_~i~0 35)} is VALID [2022-04-28 03:05:57,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {127921#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127922#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:57,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {127922#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127922#(<= main_~i~0 36)} is VALID [2022-04-28 03:05:57,050 INFO L290 TraceCheckUtils]: 79: Hoare triple {127922#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127923#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:57,050 INFO L290 TraceCheckUtils]: 80: Hoare triple {127923#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127923#(<= main_~i~0 37)} is VALID [2022-04-28 03:05:57,050 INFO L290 TraceCheckUtils]: 81: Hoare triple {127923#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127924#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:57,050 INFO L290 TraceCheckUtils]: 82: Hoare triple {127924#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127924#(<= main_~i~0 38)} is VALID [2022-04-28 03:05:57,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {127924#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127925#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:57,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {127925#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127925#(<= main_~i~0 39)} is VALID [2022-04-28 03:05:57,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {127925#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127926#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:57,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {127926#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127926#(<= main_~i~0 40)} is VALID [2022-04-28 03:05:57,052 INFO L290 TraceCheckUtils]: 87: Hoare triple {127926#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127927#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:57,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {127927#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127927#(<= main_~i~0 41)} is VALID [2022-04-28 03:05:57,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {127927#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127928#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:57,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {127928#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127928#(<= main_~i~0 42)} is VALID [2022-04-28 03:05:57,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {127928#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127929#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:57,053 INFO L290 TraceCheckUtils]: 92: Hoare triple {127929#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127929#(<= main_~i~0 43)} is VALID [2022-04-28 03:05:57,053 INFO L290 TraceCheckUtils]: 93: Hoare triple {127929#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127930#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:57,053 INFO L290 TraceCheckUtils]: 94: Hoare triple {127930#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127930#(<= main_~i~0 44)} is VALID [2022-04-28 03:05:57,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {127930#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127931#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:57,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {127931#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127931#(<= main_~i~0 45)} is VALID [2022-04-28 03:05:57,054 INFO L290 TraceCheckUtils]: 97: Hoare triple {127931#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127932#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:57,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {127932#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127932#(<= main_~i~0 46)} is VALID [2022-04-28 03:05:57,054 INFO L290 TraceCheckUtils]: 99: Hoare triple {127932#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127933#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:57,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {127933#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127933#(<= main_~i~0 47)} is VALID [2022-04-28 03:05:57,055 INFO L290 TraceCheckUtils]: 101: Hoare triple {127933#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127934#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:57,055 INFO L290 TraceCheckUtils]: 102: Hoare triple {127934#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127934#(<= main_~i~0 48)} is VALID [2022-04-28 03:05:57,055 INFO L290 TraceCheckUtils]: 103: Hoare triple {127934#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127935#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:57,055 INFO L290 TraceCheckUtils]: 104: Hoare triple {127935#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127935#(<= main_~i~0 49)} is VALID [2022-04-28 03:05:57,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {127935#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127936#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:57,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {127936#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127936#(<= main_~i~0 50)} is VALID [2022-04-28 03:05:57,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {127936#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127937#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:57,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {127937#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127937#(<= main_~i~0 51)} is VALID [2022-04-28 03:05:57,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {127937#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127938#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:57,057 INFO L290 TraceCheckUtils]: 110: Hoare triple {127938#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127938#(<= main_~i~0 52)} is VALID [2022-04-28 03:05:57,057 INFO L290 TraceCheckUtils]: 111: Hoare triple {127938#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127939#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:57,057 INFO L290 TraceCheckUtils]: 112: Hoare triple {127939#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127939#(<= main_~i~0 53)} is VALID [2022-04-28 03:05:57,057 INFO L290 TraceCheckUtils]: 113: Hoare triple {127939#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127940#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:57,058 INFO L290 TraceCheckUtils]: 114: Hoare triple {127940#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127940#(<= main_~i~0 54)} is VALID [2022-04-28 03:05:57,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {127940#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127941#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:57,058 INFO L290 TraceCheckUtils]: 116: Hoare triple {127941#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127941#(<= main_~i~0 55)} is VALID [2022-04-28 03:05:57,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {127941#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127942#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:57,058 INFO L290 TraceCheckUtils]: 118: Hoare triple {127942#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127942#(<= main_~i~0 56)} is VALID [2022-04-28 03:05:57,059 INFO L290 TraceCheckUtils]: 119: Hoare triple {127942#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127943#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:57,059 INFO L290 TraceCheckUtils]: 120: Hoare triple {127943#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127943#(<= main_~i~0 57)} is VALID [2022-04-28 03:05:57,059 INFO L290 TraceCheckUtils]: 121: Hoare triple {127943#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127944#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:57,059 INFO L290 TraceCheckUtils]: 122: Hoare triple {127944#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127944#(<= main_~i~0 58)} is VALID [2022-04-28 03:05:57,060 INFO L290 TraceCheckUtils]: 123: Hoare triple {127944#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127945#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:57,060 INFO L290 TraceCheckUtils]: 124: Hoare triple {127945#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127945#(<= main_~i~0 59)} is VALID [2022-04-28 03:05:57,060 INFO L290 TraceCheckUtils]: 125: Hoare triple {127945#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127946#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:57,060 INFO L290 TraceCheckUtils]: 126: Hoare triple {127946#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127946#(<= main_~i~0 60)} is VALID [2022-04-28 03:05:57,060 INFO L290 TraceCheckUtils]: 127: Hoare triple {127946#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127947#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:57,061 INFO L290 TraceCheckUtils]: 128: Hoare triple {127947#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127947#(<= main_~i~0 61)} is VALID [2022-04-28 03:05:57,061 INFO L290 TraceCheckUtils]: 129: Hoare triple {127947#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127948#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:57,061 INFO L290 TraceCheckUtils]: 130: Hoare triple {127948#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127948#(<= main_~i~0 62)} is VALID [2022-04-28 03:05:57,061 INFO L290 TraceCheckUtils]: 131: Hoare triple {127948#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127949#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:57,062 INFO L290 TraceCheckUtils]: 132: Hoare triple {127949#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127949#(<= main_~i~0 63)} is VALID [2022-04-28 03:05:57,062 INFO L290 TraceCheckUtils]: 133: Hoare triple {127949#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127950#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:57,062 INFO L290 TraceCheckUtils]: 134: Hoare triple {127950#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127950#(<= main_~i~0 64)} is VALID [2022-04-28 03:05:57,062 INFO L290 TraceCheckUtils]: 135: Hoare triple {127950#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127951#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:57,062 INFO L290 TraceCheckUtils]: 136: Hoare triple {127951#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127951#(<= main_~i~0 65)} is VALID [2022-04-28 03:05:57,063 INFO L290 TraceCheckUtils]: 137: Hoare triple {127951#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127952#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:57,063 INFO L290 TraceCheckUtils]: 138: Hoare triple {127952#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {127952#(<= main_~i~0 66)} is VALID [2022-04-28 03:05:57,063 INFO L290 TraceCheckUtils]: 139: Hoare triple {127952#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {127953#(<= main_~i~0 67)} is VALID [2022-04-28 03:05:57,063 INFO L290 TraceCheckUtils]: 140: Hoare triple {127953#(<= main_~i~0 67)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-28 03:05:57,063 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-28 03:05:57,064 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-28 03:05:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:05:57,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:01,041 INFO L290 TraceCheckUtils]: 156: Hoare triple {127882#false} assume !false; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 155: Hoare triple {127882#false} assume 0 == ~cond; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 154: Hoare triple {127882#false} ~cond := #in~cond; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L272 TraceCheckUtils]: 153: Hoare triple {127882#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 152: Hoare triple {127882#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 151: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 150: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 149: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 148: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 147: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 146: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 145: Hoare triple {127882#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 144: Hoare triple {127882#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 143: Hoare triple {127882#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 142: Hoare triple {127882#false} #t~short5 := ~i~0 < 1024; {127882#false} is VALID [2022-04-28 03:06:01,042 INFO L290 TraceCheckUtils]: 141: Hoare triple {127882#false} ~i~0 := 0; {127882#false} is VALID [2022-04-28 03:06:01,043 INFO L290 TraceCheckUtils]: 140: Hoare triple {128475#(< main_~i~0 1024)} assume !(~i~0 < 1024); {127882#false} is VALID [2022-04-28 03:06:01,043 INFO L290 TraceCheckUtils]: 139: Hoare triple {128479#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128475#(< main_~i~0 1024)} is VALID [2022-04-28 03:06:01,044 INFO L290 TraceCheckUtils]: 138: Hoare triple {128479#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128479#(< main_~i~0 1023)} is VALID [2022-04-28 03:06:01,044 INFO L290 TraceCheckUtils]: 137: Hoare triple {128486#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128479#(< main_~i~0 1023)} is VALID [2022-04-28 03:06:01,044 INFO L290 TraceCheckUtils]: 136: Hoare triple {128486#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128486#(< main_~i~0 1022)} is VALID [2022-04-28 03:06:01,045 INFO L290 TraceCheckUtils]: 135: Hoare triple {128493#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128486#(< main_~i~0 1022)} is VALID [2022-04-28 03:06:01,045 INFO L290 TraceCheckUtils]: 134: Hoare triple {128493#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128493#(< main_~i~0 1021)} is VALID [2022-04-28 03:06:01,045 INFO L290 TraceCheckUtils]: 133: Hoare triple {128500#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128493#(< main_~i~0 1021)} is VALID [2022-04-28 03:06:01,046 INFO L290 TraceCheckUtils]: 132: Hoare triple {128500#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128500#(< main_~i~0 1020)} is VALID [2022-04-28 03:06:01,046 INFO L290 TraceCheckUtils]: 131: Hoare triple {128507#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128500#(< main_~i~0 1020)} is VALID [2022-04-28 03:06:01,046 INFO L290 TraceCheckUtils]: 130: Hoare triple {128507#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128507#(< main_~i~0 1019)} is VALID [2022-04-28 03:06:01,047 INFO L290 TraceCheckUtils]: 129: Hoare triple {128514#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128507#(< main_~i~0 1019)} is VALID [2022-04-28 03:06:01,047 INFO L290 TraceCheckUtils]: 128: Hoare triple {128514#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128514#(< main_~i~0 1018)} is VALID [2022-04-28 03:06:01,047 INFO L290 TraceCheckUtils]: 127: Hoare triple {128521#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128514#(< main_~i~0 1018)} is VALID [2022-04-28 03:06:01,048 INFO L290 TraceCheckUtils]: 126: Hoare triple {128521#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128521#(< main_~i~0 1017)} is VALID [2022-04-28 03:06:01,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {128528#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128521#(< main_~i~0 1017)} is VALID [2022-04-28 03:06:01,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {128528#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128528#(< main_~i~0 1016)} is VALID [2022-04-28 03:06:01,049 INFO L290 TraceCheckUtils]: 123: Hoare triple {128535#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128528#(< main_~i~0 1016)} is VALID [2022-04-28 03:06:01,049 INFO L290 TraceCheckUtils]: 122: Hoare triple {128535#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128535#(< main_~i~0 1015)} is VALID [2022-04-28 03:06:01,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {128542#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128535#(< main_~i~0 1015)} is VALID [2022-04-28 03:06:01,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {128542#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128542#(< main_~i~0 1014)} is VALID [2022-04-28 03:06:01,050 INFO L290 TraceCheckUtils]: 119: Hoare triple {128549#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128542#(< main_~i~0 1014)} is VALID [2022-04-28 03:06:01,050 INFO L290 TraceCheckUtils]: 118: Hoare triple {128549#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128549#(< main_~i~0 1013)} is VALID [2022-04-28 03:06:01,051 INFO L290 TraceCheckUtils]: 117: Hoare triple {128556#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128549#(< main_~i~0 1013)} is VALID [2022-04-28 03:06:01,051 INFO L290 TraceCheckUtils]: 116: Hoare triple {128556#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128556#(< main_~i~0 1012)} is VALID [2022-04-28 03:06:01,051 INFO L290 TraceCheckUtils]: 115: Hoare triple {128563#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128556#(< main_~i~0 1012)} is VALID [2022-04-28 03:06:01,052 INFO L290 TraceCheckUtils]: 114: Hoare triple {128563#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128563#(< main_~i~0 1011)} is VALID [2022-04-28 03:06:01,052 INFO L290 TraceCheckUtils]: 113: Hoare triple {128570#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128563#(< main_~i~0 1011)} is VALID [2022-04-28 03:06:01,052 INFO L290 TraceCheckUtils]: 112: Hoare triple {128570#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128570#(< main_~i~0 1010)} is VALID [2022-04-28 03:06:01,053 INFO L290 TraceCheckUtils]: 111: Hoare triple {128577#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128570#(< main_~i~0 1010)} is VALID [2022-04-28 03:06:01,053 INFO L290 TraceCheckUtils]: 110: Hoare triple {128577#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128577#(< main_~i~0 1009)} is VALID [2022-04-28 03:06:01,053 INFO L290 TraceCheckUtils]: 109: Hoare triple {128584#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128577#(< main_~i~0 1009)} is VALID [2022-04-28 03:06:01,054 INFO L290 TraceCheckUtils]: 108: Hoare triple {128584#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128584#(< main_~i~0 1008)} is VALID [2022-04-28 03:06:01,054 INFO L290 TraceCheckUtils]: 107: Hoare triple {128591#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128584#(< main_~i~0 1008)} is VALID [2022-04-28 03:06:01,054 INFO L290 TraceCheckUtils]: 106: Hoare triple {128591#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128591#(< main_~i~0 1007)} is VALID [2022-04-28 03:06:01,055 INFO L290 TraceCheckUtils]: 105: Hoare triple {128598#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128591#(< main_~i~0 1007)} is VALID [2022-04-28 03:06:01,055 INFO L290 TraceCheckUtils]: 104: Hoare triple {128598#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128598#(< main_~i~0 1006)} is VALID [2022-04-28 03:06:01,055 INFO L290 TraceCheckUtils]: 103: Hoare triple {128605#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128598#(< main_~i~0 1006)} is VALID [2022-04-28 03:06:01,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {128605#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128605#(< main_~i~0 1005)} is VALID [2022-04-28 03:06:01,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {128612#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128605#(< main_~i~0 1005)} is VALID [2022-04-28 03:06:01,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {128612#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128612#(< main_~i~0 1004)} is VALID [2022-04-28 03:06:01,057 INFO L290 TraceCheckUtils]: 99: Hoare triple {128619#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128612#(< main_~i~0 1004)} is VALID [2022-04-28 03:06:01,057 INFO L290 TraceCheckUtils]: 98: Hoare triple {128619#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128619#(< main_~i~0 1003)} is VALID [2022-04-28 03:06:01,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {128626#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128619#(< main_~i~0 1003)} is VALID [2022-04-28 03:06:01,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {128626#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128626#(< main_~i~0 1002)} is VALID [2022-04-28 03:06:01,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {128633#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128626#(< main_~i~0 1002)} is VALID [2022-04-28 03:06:01,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {128633#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128633#(< main_~i~0 1001)} is VALID [2022-04-28 03:06:01,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {128640#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128633#(< main_~i~0 1001)} is VALID [2022-04-28 03:06:01,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {128640#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128640#(< main_~i~0 1000)} is VALID [2022-04-28 03:06:01,060 INFO L290 TraceCheckUtils]: 91: Hoare triple {128647#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128640#(< main_~i~0 1000)} is VALID [2022-04-28 03:06:01,060 INFO L290 TraceCheckUtils]: 90: Hoare triple {128647#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128647#(< main_~i~0 999)} is VALID [2022-04-28 03:06:01,060 INFO L290 TraceCheckUtils]: 89: Hoare triple {128654#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128647#(< main_~i~0 999)} is VALID [2022-04-28 03:06:01,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {128654#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128654#(< main_~i~0 998)} is VALID [2022-04-28 03:06:01,061 INFO L290 TraceCheckUtils]: 87: Hoare triple {128661#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128654#(< main_~i~0 998)} is VALID [2022-04-28 03:06:01,061 INFO L290 TraceCheckUtils]: 86: Hoare triple {128661#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128661#(< main_~i~0 997)} is VALID [2022-04-28 03:06:01,062 INFO L290 TraceCheckUtils]: 85: Hoare triple {128668#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128661#(< main_~i~0 997)} is VALID [2022-04-28 03:06:01,062 INFO L290 TraceCheckUtils]: 84: Hoare triple {128668#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128668#(< main_~i~0 996)} is VALID [2022-04-28 03:06:01,062 INFO L290 TraceCheckUtils]: 83: Hoare triple {128675#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128668#(< main_~i~0 996)} is VALID [2022-04-28 03:06:01,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {128675#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128675#(< main_~i~0 995)} is VALID [2022-04-28 03:06:01,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {128682#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128675#(< main_~i~0 995)} is VALID [2022-04-28 03:06:01,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {128682#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128682#(< main_~i~0 994)} is VALID [2022-04-28 03:06:01,064 INFO L290 TraceCheckUtils]: 79: Hoare triple {128689#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128682#(< main_~i~0 994)} is VALID [2022-04-28 03:06:01,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {128689#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128689#(< main_~i~0 993)} is VALID [2022-04-28 03:06:01,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {128696#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128689#(< main_~i~0 993)} is VALID [2022-04-28 03:06:01,065 INFO L290 TraceCheckUtils]: 76: Hoare triple {128696#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128696#(< main_~i~0 992)} is VALID [2022-04-28 03:06:01,065 INFO L290 TraceCheckUtils]: 75: Hoare triple {128703#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128696#(< main_~i~0 992)} is VALID [2022-04-28 03:06:01,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {128703#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128703#(< main_~i~0 991)} is VALID [2022-04-28 03:06:01,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {128710#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128703#(< main_~i~0 991)} is VALID [2022-04-28 03:06:01,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {128710#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128710#(< main_~i~0 990)} is VALID [2022-04-28 03:06:01,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {128717#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128710#(< main_~i~0 990)} is VALID [2022-04-28 03:06:01,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {128717#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128717#(< main_~i~0 989)} is VALID [2022-04-28 03:06:01,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {128724#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128717#(< main_~i~0 989)} is VALID [2022-04-28 03:06:01,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {128724#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128724#(< main_~i~0 988)} is VALID [2022-04-28 03:06:01,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {128731#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128724#(< main_~i~0 988)} is VALID [2022-04-28 03:06:01,068 INFO L290 TraceCheckUtils]: 66: Hoare triple {128731#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128731#(< main_~i~0 987)} is VALID [2022-04-28 03:06:01,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {128738#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128731#(< main_~i~0 987)} is VALID [2022-04-28 03:06:01,069 INFO L290 TraceCheckUtils]: 64: Hoare triple {128738#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128738#(< main_~i~0 986)} is VALID [2022-04-28 03:06:01,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {128745#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128738#(< main_~i~0 986)} is VALID [2022-04-28 03:06:01,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {128745#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128745#(< main_~i~0 985)} is VALID [2022-04-28 03:06:01,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {128752#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128745#(< main_~i~0 985)} is VALID [2022-04-28 03:06:01,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {128752#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128752#(< main_~i~0 984)} is VALID [2022-04-28 03:06:01,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {128759#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128752#(< main_~i~0 984)} is VALID [2022-04-28 03:06:01,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {128759#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128759#(< main_~i~0 983)} is VALID [2022-04-28 03:06:01,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {128766#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128759#(< main_~i~0 983)} is VALID [2022-04-28 03:06:01,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {128766#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128766#(< main_~i~0 982)} is VALID [2022-04-28 03:06:01,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {128773#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128766#(< main_~i~0 982)} is VALID [2022-04-28 03:06:01,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {128773#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128773#(< main_~i~0 981)} is VALID [2022-04-28 03:06:01,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {128780#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128773#(< main_~i~0 981)} is VALID [2022-04-28 03:06:01,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {128780#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128780#(< main_~i~0 980)} is VALID [2022-04-28 03:06:01,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {128787#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128780#(< main_~i~0 980)} is VALID [2022-04-28 03:06:01,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {128787#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128787#(< main_~i~0 979)} is VALID [2022-04-28 03:06:01,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {128794#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128787#(< main_~i~0 979)} is VALID [2022-04-28 03:06:01,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {128794#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128794#(< main_~i~0 978)} is VALID [2022-04-28 03:06:01,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {128801#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128794#(< main_~i~0 978)} is VALID [2022-04-28 03:06:01,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {128801#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128801#(< main_~i~0 977)} is VALID [2022-04-28 03:06:01,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {128808#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128801#(< main_~i~0 977)} is VALID [2022-04-28 03:06:01,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {128808#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128808#(< main_~i~0 976)} is VALID [2022-04-28 03:06:01,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {128815#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128808#(< main_~i~0 976)} is VALID [2022-04-28 03:06:01,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {128815#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128815#(< main_~i~0 975)} is VALID [2022-04-28 03:06:01,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {128822#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128815#(< main_~i~0 975)} is VALID [2022-04-28 03:06:01,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {128822#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128822#(< main_~i~0 974)} is VALID [2022-04-28 03:06:01,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {128829#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128822#(< main_~i~0 974)} is VALID [2022-04-28 03:06:01,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {128829#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128829#(< main_~i~0 973)} is VALID [2022-04-28 03:06:01,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {128836#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128829#(< main_~i~0 973)} is VALID [2022-04-28 03:06:01,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {128836#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128836#(< main_~i~0 972)} is VALID [2022-04-28 03:06:01,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {128843#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128836#(< main_~i~0 972)} is VALID [2022-04-28 03:06:01,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {128843#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128843#(< main_~i~0 971)} is VALID [2022-04-28 03:06:01,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {128850#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128843#(< main_~i~0 971)} is VALID [2022-04-28 03:06:01,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {128850#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128850#(< main_~i~0 970)} is VALID [2022-04-28 03:06:01,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {128857#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128850#(< main_~i~0 970)} is VALID [2022-04-28 03:06:01,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {128857#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128857#(< main_~i~0 969)} is VALID [2022-04-28 03:06:01,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {128864#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128857#(< main_~i~0 969)} is VALID [2022-04-28 03:06:01,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {128864#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128864#(< main_~i~0 968)} is VALID [2022-04-28 03:06:01,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {128871#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128864#(< main_~i~0 968)} is VALID [2022-04-28 03:06:01,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {128871#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128871#(< main_~i~0 967)} is VALID [2022-04-28 03:06:01,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {128878#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128871#(< main_~i~0 967)} is VALID [2022-04-28 03:06:01,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {128878#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128878#(< main_~i~0 966)} is VALID [2022-04-28 03:06:01,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {128885#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128878#(< main_~i~0 966)} is VALID [2022-04-28 03:06:01,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {128885#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128885#(< main_~i~0 965)} is VALID [2022-04-28 03:06:01,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {128892#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128885#(< main_~i~0 965)} is VALID [2022-04-28 03:06:01,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {128892#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128892#(< main_~i~0 964)} is VALID [2022-04-28 03:06:01,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {128899#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128892#(< main_~i~0 964)} is VALID [2022-04-28 03:06:01,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {128899#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128899#(< main_~i~0 963)} is VALID [2022-04-28 03:06:01,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {128906#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128899#(< main_~i~0 963)} is VALID [2022-04-28 03:06:01,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {128906#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128906#(< main_~i~0 962)} is VALID [2022-04-28 03:06:01,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {128913#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128906#(< main_~i~0 962)} is VALID [2022-04-28 03:06:01,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {128913#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128913#(< main_~i~0 961)} is VALID [2022-04-28 03:06:01,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {128920#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128913#(< main_~i~0 961)} is VALID [2022-04-28 03:06:01,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {128920#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128920#(< main_~i~0 960)} is VALID [2022-04-28 03:06:01,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {128927#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128920#(< main_~i~0 960)} is VALID [2022-04-28 03:06:01,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {128927#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128927#(< main_~i~0 959)} is VALID [2022-04-28 03:06:01,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {128934#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128927#(< main_~i~0 959)} is VALID [2022-04-28 03:06:01,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {128934#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128934#(< main_~i~0 958)} is VALID [2022-04-28 03:06:01,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {128941#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128934#(< main_~i~0 958)} is VALID [2022-04-28 03:06:01,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {128941#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {128941#(< main_~i~0 957)} is VALID [2022-04-28 03:06:01,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {127881#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {128941#(< main_~i~0 957)} is VALID [2022-04-28 03:06:01,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {127881#true} call #t~ret6 := main(); {127881#true} is VALID [2022-04-28 03:06:01,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127881#true} {127881#true} #64#return; {127881#true} is VALID [2022-04-28 03:06:01,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {127881#true} assume true; {127881#true} is VALID [2022-04-28 03:06:01,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {127881#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(12, 2); {127881#true} is VALID [2022-04-28 03:06:01,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {127881#true} call ULTIMATE.init(); {127881#true} is VALID [2022-04-28 03:06:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:06:01,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321886036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:01,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:01,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-28 03:06:01,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654068468] [2022-04-28 03:06:01,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654068468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:01,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:01,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-28 03:06:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623158189] [2022-04-28 03:06:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 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 157 [2022-04-28 03:06:01,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:01,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:01,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-28 03:06:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-28 03:06:01,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9593, Invalid=9867, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:06:01,195 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:18,917 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2022-04-28 03:06:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-28 03:06:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 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 157 [2022-04-28 03:06:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 640 transitions. [2022-04-28 03:06:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 640 transitions. [2022-04-28 03:06:18,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 640 transitions. [2022-04-28 03:06:19,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:19,383 INFO L225 Difference]: With dead ends: 509 [2022-04-28 03:06:19,383 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 03:06:19,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=19046, Invalid=24010, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:06:19,385 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1509 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:19,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 57 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:06:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 03:06:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 160. [2022-04-28 03:06:20,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:20,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:20,256 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:20,256 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:20,263 INFO L93 Difference]: Finished difference Result 492 states and 628 transitions. [2022-04-28 03:06:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 628 transitions. [2022-04-28 03:06:20,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:20,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:20,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 03:06:20,264 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 03:06:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:20,271 INFO L93 Difference]: Finished difference Result 492 states and 628 transitions. [2022-04-28 03:06:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 628 transitions. [2022-04-28 03:06:20,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:20,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:20,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:20,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2022-04-28 03:06:20,273 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 157 [2022-04-28 03:06:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:20,273 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2022-04-28 03:06:20,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 70 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:20,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 164 transitions. [2022-04-28 03:06:20,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-28 03:06:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 03:06:20,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:20,688 INFO L195 NwaCegarLoop]: trace histogram [68, 68, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:20,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 03:06:20,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:20,906 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -569777611, now seen corresponding path program 137 times [2022-04-28 03:06:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:20,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452735059] [2022-04-28 03:06:20,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:06:20,909 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:06:20,909 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:06:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -569777611, now seen corresponding path program 138 times [2022-04-28 03:06:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:20,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650900024] [2022-04-28 03:06:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:22,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {131497#(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(12, 2); {131423#true} is VALID [2022-04-28 03:06:22,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-28 03:06:22,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-28 03:06:22,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:22,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {131497#(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(12, 2); {131423#true} is VALID [2022-04-28 03:06:22,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-28 03:06:22,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-28 03:06:22,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-28 03:06:22,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131428#(= main_~i~0 0)} is VALID [2022-04-28 03:06:22,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {131428#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131428#(= main_~i~0 0)} is VALID [2022-04-28 03:06:22,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {131428#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:22,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {131429#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:22,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {131429#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:22,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {131430#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:22,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {131430#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131431#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:22,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {131431#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131431#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:22,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {131431#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131432#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:22,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {131432#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131432#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:22,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {131432#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131433#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:22,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {131433#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131433#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:22,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {131433#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131434#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:22,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {131434#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131434#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:22,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {131434#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131435#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:22,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {131435#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131435#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:22,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {131435#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131436#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:22,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {131436#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131436#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:22,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {131436#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131437#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:22,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {131437#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131437#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:22,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {131437#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131438#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:22,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {131438#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131438#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:22,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {131438#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131439#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:22,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {131439#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131439#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:22,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {131439#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131440#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:22,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {131440#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131440#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:22,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {131440#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131441#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:22,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {131441#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131441#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:22,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {131441#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131442#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:22,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {131442#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131442#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:22,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {131442#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131443#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:22,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {131443#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131443#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:22,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {131443#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131444#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:22,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {131444#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131444#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:22,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {131444#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131445#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:22,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {131445#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131445#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:22,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {131445#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131446#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:22,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {131446#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131446#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:22,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {131446#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131447#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:22,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {131447#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131447#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:22,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {131447#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131448#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:22,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {131448#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131448#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:22,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {131448#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131449#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:22,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {131449#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131449#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:22,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {131449#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131450#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:22,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {131450#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131450#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:22,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {131450#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131451#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:22,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {131451#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131451#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:22,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {131451#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131452#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:22,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {131452#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131452#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:22,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {131452#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131453#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:22,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {131453#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131453#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:22,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {131453#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131454#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:22,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {131454#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131454#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:22,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {131454#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131455#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:22,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {131455#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131455#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:22,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {131455#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131456#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:22,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {131456#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131456#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:22,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {131456#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131457#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:22,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {131457#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131457#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:22,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {131457#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131458#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:22,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {131458#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131458#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:22,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {131458#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131459#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:22,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {131459#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131459#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:22,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {131459#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131460#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:22,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {131460#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131460#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:22,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {131460#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131461#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:22,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {131461#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131461#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:22,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {131461#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131462#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:22,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {131462#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131462#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:22,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {131462#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131463#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:22,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {131463#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131463#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:22,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {131463#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131464#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:22,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {131464#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131464#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:22,460 INFO L290 TraceCheckUtils]: 79: Hoare triple {131464#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131465#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:22,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {131465#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131465#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:22,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {131465#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131466#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:22,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {131466#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131466#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:22,461 INFO L290 TraceCheckUtils]: 83: Hoare triple {131466#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131467#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:22,461 INFO L290 TraceCheckUtils]: 84: Hoare triple {131467#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131467#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:22,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {131467#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131468#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:22,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {131468#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131468#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:22,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {131468#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131469#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:22,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {131469#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131469#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:22,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {131469#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131470#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:22,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {131470#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131470#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:22,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {131470#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131471#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:22,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {131471#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131471#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:22,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {131471#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131472#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:22,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {131472#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131472#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:22,465 INFO L290 TraceCheckUtils]: 95: Hoare triple {131472#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131473#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:22,465 INFO L290 TraceCheckUtils]: 96: Hoare triple {131473#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131473#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:22,466 INFO L290 TraceCheckUtils]: 97: Hoare triple {131473#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131474#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:22,466 INFO L290 TraceCheckUtils]: 98: Hoare triple {131474#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131474#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:22,466 INFO L290 TraceCheckUtils]: 99: Hoare triple {131474#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131475#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:22,467 INFO L290 TraceCheckUtils]: 100: Hoare triple {131475#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131475#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:22,467 INFO L290 TraceCheckUtils]: 101: Hoare triple {131475#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131476#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:22,467 INFO L290 TraceCheckUtils]: 102: Hoare triple {131476#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131476#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:22,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {131476#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131477#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:22,468 INFO L290 TraceCheckUtils]: 104: Hoare triple {131477#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131477#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:22,468 INFO L290 TraceCheckUtils]: 105: Hoare triple {131477#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131478#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:22,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {131478#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131478#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:22,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {131478#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131479#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:22,469 INFO L290 TraceCheckUtils]: 108: Hoare triple {131479#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131479#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:22,470 INFO L290 TraceCheckUtils]: 109: Hoare triple {131479#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131480#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:22,470 INFO L290 TraceCheckUtils]: 110: Hoare triple {131480#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131480#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:22,470 INFO L290 TraceCheckUtils]: 111: Hoare triple {131480#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131481#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:22,470 INFO L290 TraceCheckUtils]: 112: Hoare triple {131481#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131481#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:22,471 INFO L290 TraceCheckUtils]: 113: Hoare triple {131481#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131482#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:22,471 INFO L290 TraceCheckUtils]: 114: Hoare triple {131482#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131482#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:22,471 INFO L290 TraceCheckUtils]: 115: Hoare triple {131482#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131483#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:22,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {131483#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131483#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:22,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {131483#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131484#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:22,472 INFO L290 TraceCheckUtils]: 118: Hoare triple {131484#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131484#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:22,473 INFO L290 TraceCheckUtils]: 119: Hoare triple {131484#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131485#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:22,473 INFO L290 TraceCheckUtils]: 120: Hoare triple {131485#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131485#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:22,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {131485#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131486#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:22,474 INFO L290 TraceCheckUtils]: 122: Hoare triple {131486#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131486#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:22,474 INFO L290 TraceCheckUtils]: 123: Hoare triple {131486#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131487#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:22,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {131487#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131487#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:22,475 INFO L290 TraceCheckUtils]: 125: Hoare triple {131487#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131488#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:22,475 INFO L290 TraceCheckUtils]: 126: Hoare triple {131488#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131488#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:22,475 INFO L290 TraceCheckUtils]: 127: Hoare triple {131488#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131489#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:22,476 INFO L290 TraceCheckUtils]: 128: Hoare triple {131489#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131489#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:22,476 INFO L290 TraceCheckUtils]: 129: Hoare triple {131489#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131490#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:22,476 INFO L290 TraceCheckUtils]: 130: Hoare triple {131490#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131490#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:22,477 INFO L290 TraceCheckUtils]: 131: Hoare triple {131490#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131491#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:22,477 INFO L290 TraceCheckUtils]: 132: Hoare triple {131491#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131491#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:22,477 INFO L290 TraceCheckUtils]: 133: Hoare triple {131491#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131492#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:22,478 INFO L290 TraceCheckUtils]: 134: Hoare triple {131492#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131492#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:22,478 INFO L290 TraceCheckUtils]: 135: Hoare triple {131492#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131493#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:22,478 INFO L290 TraceCheckUtils]: 136: Hoare triple {131493#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131493#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:22,479 INFO L290 TraceCheckUtils]: 137: Hoare triple {131493#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131494#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:22,479 INFO L290 TraceCheckUtils]: 138: Hoare triple {131494#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131494#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:22,479 INFO L290 TraceCheckUtils]: 139: Hoare triple {131494#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131495#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:22,479 INFO L290 TraceCheckUtils]: 140: Hoare triple {131495#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131495#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 141: Hoare triple {131495#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131496#(<= main_~i~0 68)} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 142: Hoare triple {131496#(<= main_~i~0 68)} assume !(~i~0 < 1024); {131424#false} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 143: Hoare triple {131424#false} ~i~0 := 0; {131424#false} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 144: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 145: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-28 03:06:22,480 INFO L290 TraceCheckUtils]: 146: Hoare triple {131424#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 147: Hoare triple {131424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 148: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 149: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 150: Hoare triple {131424#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 151: Hoare triple {131424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 152: Hoare triple {131424#false} #t~short5 := ~i~0 < 1024; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 153: Hoare triple {131424#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 154: Hoare triple {131424#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L272 TraceCheckUtils]: 155: Hoare triple {131424#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 156: Hoare triple {131424#false} ~cond := #in~cond; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 157: Hoare triple {131424#false} assume 0 == ~cond; {131424#false} is VALID [2022-04-28 03:06:22,481 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-28 03:06:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:06:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650900024] [2022-04-28 03:06:22,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650900024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640694244] [2022-04-28 03:06:22,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:22,483 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:06:22,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-28 03:06:22,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:06:22,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:22,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:06:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:22,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:23,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131423#true} is VALID [2022-04-28 03:06:23,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#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(12, 2); {131423#true} is VALID [2022-04-28 03:06:23,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-28 03:06:23,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 61: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 62: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 63: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 64: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 66: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 73: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,258 INFO L290 TraceCheckUtils]: 80: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 84: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 85: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 86: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 87: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 88: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 89: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 91: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 94: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 95: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,259 INFO L290 TraceCheckUtils]: 96: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 97: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 98: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 99: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 100: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 103: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 104: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 105: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 106: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 107: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 108: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 109: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 110: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,260 INFO L290 TraceCheckUtils]: 111: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 112: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 113: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 114: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 115: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 116: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 117: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 118: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 119: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 120: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 121: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 122: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 123: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 124: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 125: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 126: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,261 INFO L290 TraceCheckUtils]: 127: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 128: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 129: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 130: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 131: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 132: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 133: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 134: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 135: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 136: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 137: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 138: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 139: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 140: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 141: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,262 INFO L290 TraceCheckUtils]: 142: Hoare triple {131423#true} assume !(~i~0 < 1024); {131423#true} is VALID [2022-04-28 03:06:23,263 INFO L290 TraceCheckUtils]: 143: Hoare triple {131423#true} ~i~0 := 0; {131930#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:23,263 INFO L290 TraceCheckUtils]: 144: Hoare triple {131930#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {131930#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:23,263 INFO L290 TraceCheckUtils]: 145: Hoare triple {131930#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131930#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:23,263 INFO L290 TraceCheckUtils]: 146: Hoare triple {131930#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131930#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:23,264 INFO L290 TraceCheckUtils]: 147: Hoare triple {131930#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:23,264 INFO L290 TraceCheckUtils]: 148: Hoare triple {131429#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:23,264 INFO L290 TraceCheckUtils]: 149: Hoare triple {131429#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:23,264 INFO L290 TraceCheckUtils]: 150: Hoare triple {131429#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {131429#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:23,265 INFO L290 TraceCheckUtils]: 151: Hoare triple {131429#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:23,265 INFO L290 TraceCheckUtils]: 152: Hoare triple {131430#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:23,265 INFO L290 TraceCheckUtils]: 153: Hoare triple {131430#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:23,265 INFO L290 TraceCheckUtils]: 154: Hoare triple {131430#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131430#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:23,266 INFO L272 TraceCheckUtils]: 155: Hoare triple {131430#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:06:23,266 INFO L290 TraceCheckUtils]: 156: Hoare triple {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {131971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:06:23,266 INFO L290 TraceCheckUtils]: 157: Hoare triple {131971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {131424#false} is VALID [2022-04-28 03:06:23,266 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-28 03:06:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-28 03:06:23,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:23,501 INFO L290 TraceCheckUtils]: 158: Hoare triple {131424#false} assume !false; {131424#false} is VALID [2022-04-28 03:06:23,501 INFO L290 TraceCheckUtils]: 157: Hoare triple {131971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {131424#false} is VALID [2022-04-28 03:06:23,502 INFO L290 TraceCheckUtils]: 156: Hoare triple {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {131971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:06:23,502 INFO L272 TraceCheckUtils]: 155: Hoare triple {131987#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {131967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:06:23,502 INFO L290 TraceCheckUtils]: 154: Hoare triple {131987#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {131987#(<= main_~i~0 512)} is VALID [2022-04-28 03:06:23,502 INFO L290 TraceCheckUtils]: 153: Hoare triple {131987#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {131987#(<= main_~i~0 512)} is VALID [2022-04-28 03:06:23,503 INFO L290 TraceCheckUtils]: 152: Hoare triple {131987#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {131987#(<= main_~i~0 512)} is VALID [2022-04-28 03:06:23,503 INFO L290 TraceCheckUtils]: 151: Hoare triple {132000#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {131987#(<= main_~i~0 512)} is VALID [2022-04-28 03:06:23,503 INFO L290 TraceCheckUtils]: 150: Hoare triple {132000#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {132000#(<= main_~i~0 511)} is VALID [2022-04-28 03:06:23,503 INFO L290 TraceCheckUtils]: 149: Hoare triple {132000#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {132000#(<= main_~i~0 511)} is VALID [2022-04-28 03:06:23,503 INFO L290 TraceCheckUtils]: 148: Hoare triple {132000#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {132000#(<= main_~i~0 511)} is VALID [2022-04-28 03:06:23,504 INFO L290 TraceCheckUtils]: 147: Hoare triple {132013#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {132000#(<= main_~i~0 511)} is VALID [2022-04-28 03:06:23,504 INFO L290 TraceCheckUtils]: 146: Hoare triple {132013#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {132013#(<= main_~i~0 510)} is VALID [2022-04-28 03:06:23,504 INFO L290 TraceCheckUtils]: 145: Hoare triple {132013#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {132013#(<= main_~i~0 510)} is VALID [2022-04-28 03:06:23,504 INFO L290 TraceCheckUtils]: 144: Hoare triple {132013#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {132013#(<= main_~i~0 510)} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 143: Hoare triple {131423#true} ~i~0 := 0; {132013#(<= main_~i~0 510)} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 142: Hoare triple {131423#true} assume !(~i~0 < 1024); {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 141: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 140: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 139: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 138: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 137: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 136: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 135: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 131: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 130: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 129: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,505 INFO L290 TraceCheckUtils]: 128: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 127: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 126: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 125: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 124: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 123: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 122: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 121: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 120: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 119: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 118: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 117: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 116: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 115: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 114: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,506 INFO L290 TraceCheckUtils]: 113: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 112: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 111: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 110: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 109: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 108: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 107: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 106: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 105: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 104: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 102: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 101: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 100: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 98: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,507 INFO L290 TraceCheckUtils]: 97: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 96: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 95: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 91: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 82: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 77: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 75: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 62: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {131423#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {131423#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {131423#true} is VALID [2022-04-28 03:06:23,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {131423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {131423#true} call #t~ret6 := main(); {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131423#true} {131423#true} #64#return; {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {131423#true} assume true; {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {131423#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(12, 2); {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {131423#true} call ULTIMATE.init(); {131423#true} is VALID [2022-04-28 03:06:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4634 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-28 03:06:23,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640694244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:23,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:23,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 7, 7] total 78 [2022-04-28 03:06:23,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452735059] [2022-04-28 03:06:23,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452735059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:23,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:23,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-28 03:06:23,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196144693] [2022-04-28 03:06:23,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 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 159 [2022-04-28 03:06:23,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:23,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:23,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:23,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-28 03:06:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-28 03:06:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2781, Invalid=3225, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 03:06:23,580 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:41,197 INFO L93 Difference]: Finished difference Result 516 states and 658 transitions. [2022-04-28 03:06:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-28 03:06:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 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 159 [2022-04-28 03:06:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 649 transitions. [2022-04-28 03:06:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 649 transitions. [2022-04-28 03:06:41,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 649 transitions. [2022-04-28 03:06:41,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:41,662 INFO L225 Difference]: With dead ends: 516 [2022-04-28 03:06:41,662 INFO L226 Difference]: Without dead ends: 499 [2022-04-28 03:06:41,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7957, Invalid=13505, Unknown=0, NotChecked=0, Total=21462 [2022-04-28 03:06:41,668 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1801 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:41,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 37 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:06:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-28 03:06:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 162. [2022-04-28 03:06:42,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:42,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:42,777 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:42,777 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:42,785 INFO L93 Difference]: Finished difference Result 499 states and 637 transitions. [2022-04-28 03:06:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2022-04-28 03:06:42,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:42,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:42,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-28 03:06:42,786 INFO L87 Difference]: Start difference. First operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-28 03:06:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:42,793 INFO L93 Difference]: Finished difference Result 499 states and 637 transitions. [2022-04-28 03:06:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 637 transitions. [2022-04-28 03:06:42,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:42,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:42,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:42,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 166 transitions. [2022-04-28 03:06:42,796 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 166 transitions. Word has length 159 [2022-04-28 03:06:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:42,796 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 166 transitions. [2022-04-28 03:06:42,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 71 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:42,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 166 transitions. [2022-04-28 03:06:43,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2022-04-28 03:06:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 03:06:43,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:43,255 INFO L195 NwaCegarLoop]: trace histogram [69, 69, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:43,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-28 03:06:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:43,472 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1584578643, now seen corresponding path program 139 times [2022-04-28 03:06:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513541397] [2022-04-28 03:06:43,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:06:43,475 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:06:43,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:06:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1584578643, now seen corresponding path program 140 times [2022-04-28 03:06:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332035472] [2022-04-28 03:06:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:44,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {135024#(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(12, 2); {134949#true} is VALID [2022-04-28 03:06:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-28 03:06:44,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-28 03:06:44,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {135024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {135024#(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(12, 2); {134949#true} is VALID [2022-04-28 03:06:44,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-28 03:06:44,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-28 03:06:44,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-28 03:06:44,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {134954#(= main_~i~0 0)} is VALID [2022-04-28 03:06:44,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {134954#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134954#(= main_~i~0 0)} is VALID [2022-04-28 03:06:44,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {134954#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134955#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:44,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {134955#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134955#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:44,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {134955#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134956#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:44,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {134956#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134956#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:44,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {134956#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134957#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:44,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {134957#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134957#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:44,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {134957#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134958#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:44,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {134958#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134958#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:44,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {134958#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134959#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:44,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {134959#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134959#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:44,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {134959#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134960#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:44,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {134960#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134960#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:44,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {134960#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134961#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:44,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {134961#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134961#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:44,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {134961#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134962#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:44,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {134962#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134962#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:44,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {134962#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134963#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:44,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {134963#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134963#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:44,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {134963#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134964#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:44,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {134964#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134964#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:44,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {134964#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134965#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:44,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {134965#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134965#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:44,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {134965#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134966#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:44,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {134966#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134966#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:44,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {134966#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134967#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:44,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {134967#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134967#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:44,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {134967#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134968#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:44,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {134968#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134968#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:44,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {134968#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134969#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:44,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {134969#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134969#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:44,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {134969#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134970#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:44,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {134970#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134970#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:44,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {134970#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134971#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:44,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {134971#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134971#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:44,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {134971#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134972#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:44,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {134972#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134972#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:44,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {134972#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134973#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:44,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {134973#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134973#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:44,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {134973#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134974#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:44,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {134974#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134974#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:44,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {134974#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134975#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:44,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {134975#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134975#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:44,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {134975#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134976#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:44,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {134976#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134976#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:44,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {134976#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134977#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:44,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {134977#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134977#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:44,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {134977#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134978#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:44,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {134978#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134978#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:44,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {134978#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134979#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:44,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {134979#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134979#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:44,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {134979#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134980#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:44,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {134980#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134980#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:44,992 INFO L290 TraceCheckUtils]: 59: Hoare triple {134980#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134981#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:44,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {134981#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134981#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:44,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {134981#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134982#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:44,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {134982#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134982#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:44,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {134982#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134983#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:44,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {134983#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134983#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:44,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {134983#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134984#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:44,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {134984#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134984#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:44,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {134984#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134985#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:44,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {134985#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134985#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:44,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {134985#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134986#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:44,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {134986#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134986#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:44,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {134986#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134987#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:44,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {134987#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134987#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:44,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {134987#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134988#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:44,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {134988#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134988#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:44,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {134988#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134989#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:44,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {134989#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134989#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:44,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {134989#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134990#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:44,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {134990#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134990#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:44,997 INFO L290 TraceCheckUtils]: 79: Hoare triple {134990#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134991#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:44,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {134991#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134991#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:44,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {134991#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134992#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:44,997 INFO L290 TraceCheckUtils]: 82: Hoare triple {134992#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134992#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:44,998 INFO L290 TraceCheckUtils]: 83: Hoare triple {134992#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134993#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:44,998 INFO L290 TraceCheckUtils]: 84: Hoare triple {134993#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134993#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:44,998 INFO L290 TraceCheckUtils]: 85: Hoare triple {134993#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134994#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:44,998 INFO L290 TraceCheckUtils]: 86: Hoare triple {134994#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134994#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:44,998 INFO L290 TraceCheckUtils]: 87: Hoare triple {134994#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134995#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:44,999 INFO L290 TraceCheckUtils]: 88: Hoare triple {134995#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134995#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:44,999 INFO L290 TraceCheckUtils]: 89: Hoare triple {134995#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134996#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:44,999 INFO L290 TraceCheckUtils]: 90: Hoare triple {134996#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134996#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:44,999 INFO L290 TraceCheckUtils]: 91: Hoare triple {134996#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134997#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:45,000 INFO L290 TraceCheckUtils]: 92: Hoare triple {134997#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134997#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:45,000 INFO L290 TraceCheckUtils]: 93: Hoare triple {134997#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134998#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:45,000 INFO L290 TraceCheckUtils]: 94: Hoare triple {134998#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134998#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:45,000 INFO L290 TraceCheckUtils]: 95: Hoare triple {134998#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134999#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:45,001 INFO L290 TraceCheckUtils]: 96: Hoare triple {134999#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134999#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:45,001 INFO L290 TraceCheckUtils]: 97: Hoare triple {134999#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135000#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:45,001 INFO L290 TraceCheckUtils]: 98: Hoare triple {135000#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135000#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:45,001 INFO L290 TraceCheckUtils]: 99: Hoare triple {135000#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135001#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:45,001 INFO L290 TraceCheckUtils]: 100: Hoare triple {135001#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135001#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:45,002 INFO L290 TraceCheckUtils]: 101: Hoare triple {135001#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135002#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:45,002 INFO L290 TraceCheckUtils]: 102: Hoare triple {135002#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135002#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:45,002 INFO L290 TraceCheckUtils]: 103: Hoare triple {135002#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135003#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:45,002 INFO L290 TraceCheckUtils]: 104: Hoare triple {135003#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135003#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:45,002 INFO L290 TraceCheckUtils]: 105: Hoare triple {135003#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135004#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:45,003 INFO L290 TraceCheckUtils]: 106: Hoare triple {135004#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135004#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:45,003 INFO L290 TraceCheckUtils]: 107: Hoare triple {135004#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135005#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:45,003 INFO L290 TraceCheckUtils]: 108: Hoare triple {135005#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135005#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:45,003 INFO L290 TraceCheckUtils]: 109: Hoare triple {135005#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135006#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:45,004 INFO L290 TraceCheckUtils]: 110: Hoare triple {135006#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135006#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:45,004 INFO L290 TraceCheckUtils]: 111: Hoare triple {135006#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135007#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:45,004 INFO L290 TraceCheckUtils]: 112: Hoare triple {135007#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135007#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:45,004 INFO L290 TraceCheckUtils]: 113: Hoare triple {135007#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135008#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:45,004 INFO L290 TraceCheckUtils]: 114: Hoare triple {135008#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135008#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:45,005 INFO L290 TraceCheckUtils]: 115: Hoare triple {135008#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135009#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:45,005 INFO L290 TraceCheckUtils]: 116: Hoare triple {135009#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135009#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:45,005 INFO L290 TraceCheckUtils]: 117: Hoare triple {135009#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135010#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:45,005 INFO L290 TraceCheckUtils]: 118: Hoare triple {135010#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135010#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:45,005 INFO L290 TraceCheckUtils]: 119: Hoare triple {135010#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135011#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:45,006 INFO L290 TraceCheckUtils]: 120: Hoare triple {135011#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135011#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:45,006 INFO L290 TraceCheckUtils]: 121: Hoare triple {135011#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135012#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:45,006 INFO L290 TraceCheckUtils]: 122: Hoare triple {135012#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135012#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:45,006 INFO L290 TraceCheckUtils]: 123: Hoare triple {135012#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135013#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:45,007 INFO L290 TraceCheckUtils]: 124: Hoare triple {135013#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135013#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:45,007 INFO L290 TraceCheckUtils]: 125: Hoare triple {135013#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135014#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:45,007 INFO L290 TraceCheckUtils]: 126: Hoare triple {135014#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135014#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:45,007 INFO L290 TraceCheckUtils]: 127: Hoare triple {135014#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135015#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:45,007 INFO L290 TraceCheckUtils]: 128: Hoare triple {135015#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135015#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:45,008 INFO L290 TraceCheckUtils]: 129: Hoare triple {135015#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135016#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:45,008 INFO L290 TraceCheckUtils]: 130: Hoare triple {135016#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135016#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:45,008 INFO L290 TraceCheckUtils]: 131: Hoare triple {135016#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135017#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:45,008 INFO L290 TraceCheckUtils]: 132: Hoare triple {135017#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135017#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:45,009 INFO L290 TraceCheckUtils]: 133: Hoare triple {135017#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135018#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:45,009 INFO L290 TraceCheckUtils]: 134: Hoare triple {135018#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135018#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:45,009 INFO L290 TraceCheckUtils]: 135: Hoare triple {135018#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135019#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:45,009 INFO L290 TraceCheckUtils]: 136: Hoare triple {135019#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135019#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:45,009 INFO L290 TraceCheckUtils]: 137: Hoare triple {135019#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135020#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:45,010 INFO L290 TraceCheckUtils]: 138: Hoare triple {135020#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135020#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:45,010 INFO L290 TraceCheckUtils]: 139: Hoare triple {135020#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135021#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:45,010 INFO L290 TraceCheckUtils]: 140: Hoare triple {135021#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135021#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:45,010 INFO L290 TraceCheckUtils]: 141: Hoare triple {135021#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135022#(<= main_~i~0 68)} is VALID [2022-04-28 03:06:45,010 INFO L290 TraceCheckUtils]: 142: Hoare triple {135022#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135022#(<= main_~i~0 68)} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 143: Hoare triple {135022#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135023#(<= main_~i~0 69)} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 144: Hoare triple {135023#(<= main_~i~0 69)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:45,011 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-28 03:06:45,012 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-28 03:06:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:06:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332035472] [2022-04-28 03:06:45,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332035472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501683839] [2022-04-28 03:06:45,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:06:45,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:45,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:45,014 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:06:45,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-28 03:06:45,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:06:45,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:45,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 03:06:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:45,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:46,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {134949#true} is VALID [2022-04-28 03:06:46,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#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(12, 2); {134949#true} is VALID [2022-04-28 03:06:46,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-28 03:06:46,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-28 03:06:46,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-28 03:06:46,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {135043#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:46,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {135043#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135043#(<= main_~i~0 0)} is VALID [2022-04-28 03:06:46,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {135043#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134955#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:46,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {134955#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134955#(<= main_~i~0 1)} is VALID [2022-04-28 03:06:46,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {134955#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134956#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:46,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {134956#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134956#(<= main_~i~0 2)} is VALID [2022-04-28 03:06:46,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {134956#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134957#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:46,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {134957#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134957#(<= main_~i~0 3)} is VALID [2022-04-28 03:06:46,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {134957#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134958#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:46,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {134958#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134958#(<= main_~i~0 4)} is VALID [2022-04-28 03:06:46,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {134958#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134959#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:46,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {134959#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134959#(<= main_~i~0 5)} is VALID [2022-04-28 03:06:46,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {134959#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134960#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:46,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {134960#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134960#(<= main_~i~0 6)} is VALID [2022-04-28 03:06:46,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {134960#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134961#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:46,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {134961#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134961#(<= main_~i~0 7)} is VALID [2022-04-28 03:06:46,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {134961#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134962#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:46,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {134962#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134962#(<= main_~i~0 8)} is VALID [2022-04-28 03:06:46,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {134962#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134963#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:46,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {134963#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134963#(<= main_~i~0 9)} is VALID [2022-04-28 03:06:46,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {134963#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134964#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:46,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {134964#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134964#(<= main_~i~0 10)} is VALID [2022-04-28 03:06:46,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {134964#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134965#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:46,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {134965#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134965#(<= main_~i~0 11)} is VALID [2022-04-28 03:06:46,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {134965#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134966#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:46,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {134966#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134966#(<= main_~i~0 12)} is VALID [2022-04-28 03:06:46,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {134966#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134967#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:46,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {134967#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134967#(<= main_~i~0 13)} is VALID [2022-04-28 03:06:46,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {134967#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134968#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:46,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {134968#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134968#(<= main_~i~0 14)} is VALID [2022-04-28 03:06:46,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {134968#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134969#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:46,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {134969#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134969#(<= main_~i~0 15)} is VALID [2022-04-28 03:06:46,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {134969#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134970#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:46,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {134970#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134970#(<= main_~i~0 16)} is VALID [2022-04-28 03:06:46,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {134970#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134971#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:46,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {134971#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134971#(<= main_~i~0 17)} is VALID [2022-04-28 03:06:46,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {134971#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134972#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:46,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {134972#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134972#(<= main_~i~0 18)} is VALID [2022-04-28 03:06:46,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {134972#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134973#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:46,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {134973#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134973#(<= main_~i~0 19)} is VALID [2022-04-28 03:06:46,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {134973#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134974#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:46,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {134974#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134974#(<= main_~i~0 20)} is VALID [2022-04-28 03:06:46,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {134974#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134975#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:46,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {134975#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134975#(<= main_~i~0 21)} is VALID [2022-04-28 03:06:46,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {134975#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134976#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:46,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {134976#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134976#(<= main_~i~0 22)} is VALID [2022-04-28 03:06:46,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {134976#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134977#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:46,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {134977#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134977#(<= main_~i~0 23)} is VALID [2022-04-28 03:06:46,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {134977#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134978#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:46,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {134978#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134978#(<= main_~i~0 24)} is VALID [2022-04-28 03:06:46,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {134978#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134979#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:46,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {134979#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134979#(<= main_~i~0 25)} is VALID [2022-04-28 03:06:46,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {134979#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134980#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:46,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {134980#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134980#(<= main_~i~0 26)} is VALID [2022-04-28 03:06:46,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {134980#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134981#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:46,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {134981#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134981#(<= main_~i~0 27)} is VALID [2022-04-28 03:06:46,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {134981#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134982#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:46,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {134982#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134982#(<= main_~i~0 28)} is VALID [2022-04-28 03:06:46,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {134982#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134983#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:46,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {134983#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134983#(<= main_~i~0 29)} is VALID [2022-04-28 03:06:46,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {134983#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134984#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:46,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {134984#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134984#(<= main_~i~0 30)} is VALID [2022-04-28 03:06:46,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {134984#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134985#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:46,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {134985#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134985#(<= main_~i~0 31)} is VALID [2022-04-28 03:06:46,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {134985#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134986#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:46,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {134986#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134986#(<= main_~i~0 32)} is VALID [2022-04-28 03:06:46,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {134986#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134987#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:46,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {134987#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134987#(<= main_~i~0 33)} is VALID [2022-04-28 03:06:46,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {134987#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134988#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:46,338 INFO L290 TraceCheckUtils]: 74: Hoare triple {134988#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134988#(<= main_~i~0 34)} is VALID [2022-04-28 03:06:46,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {134988#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134989#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:46,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {134989#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134989#(<= main_~i~0 35)} is VALID [2022-04-28 03:06:46,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {134989#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134990#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:46,339 INFO L290 TraceCheckUtils]: 78: Hoare triple {134990#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134990#(<= main_~i~0 36)} is VALID [2022-04-28 03:06:46,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {134990#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134991#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:46,340 INFO L290 TraceCheckUtils]: 80: Hoare triple {134991#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134991#(<= main_~i~0 37)} is VALID [2022-04-28 03:06:46,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {134991#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134992#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:46,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {134992#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134992#(<= main_~i~0 38)} is VALID [2022-04-28 03:06:46,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {134992#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134993#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:46,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {134993#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134993#(<= main_~i~0 39)} is VALID [2022-04-28 03:06:46,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {134993#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134994#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:46,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {134994#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134994#(<= main_~i~0 40)} is VALID [2022-04-28 03:06:46,342 INFO L290 TraceCheckUtils]: 87: Hoare triple {134994#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134995#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:46,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {134995#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134995#(<= main_~i~0 41)} is VALID [2022-04-28 03:06:46,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {134995#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134996#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:46,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {134996#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134996#(<= main_~i~0 42)} is VALID [2022-04-28 03:06:46,343 INFO L290 TraceCheckUtils]: 91: Hoare triple {134996#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134997#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:46,343 INFO L290 TraceCheckUtils]: 92: Hoare triple {134997#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134997#(<= main_~i~0 43)} is VALID [2022-04-28 03:06:46,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {134997#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134998#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:46,344 INFO L290 TraceCheckUtils]: 94: Hoare triple {134998#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134998#(<= main_~i~0 44)} is VALID [2022-04-28 03:06:46,344 INFO L290 TraceCheckUtils]: 95: Hoare triple {134998#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {134999#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:46,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {134999#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {134999#(<= main_~i~0 45)} is VALID [2022-04-28 03:06:46,345 INFO L290 TraceCheckUtils]: 97: Hoare triple {134999#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135000#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:46,345 INFO L290 TraceCheckUtils]: 98: Hoare triple {135000#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135000#(<= main_~i~0 46)} is VALID [2022-04-28 03:06:46,345 INFO L290 TraceCheckUtils]: 99: Hoare triple {135000#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135001#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:46,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {135001#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135001#(<= main_~i~0 47)} is VALID [2022-04-28 03:06:46,346 INFO L290 TraceCheckUtils]: 101: Hoare triple {135001#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135002#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:46,346 INFO L290 TraceCheckUtils]: 102: Hoare triple {135002#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135002#(<= main_~i~0 48)} is VALID [2022-04-28 03:06:46,346 INFO L290 TraceCheckUtils]: 103: Hoare triple {135002#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135003#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:46,347 INFO L290 TraceCheckUtils]: 104: Hoare triple {135003#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135003#(<= main_~i~0 49)} is VALID [2022-04-28 03:06:46,347 INFO L290 TraceCheckUtils]: 105: Hoare triple {135003#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135004#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:46,347 INFO L290 TraceCheckUtils]: 106: Hoare triple {135004#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135004#(<= main_~i~0 50)} is VALID [2022-04-28 03:06:46,347 INFO L290 TraceCheckUtils]: 107: Hoare triple {135004#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135005#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:46,348 INFO L290 TraceCheckUtils]: 108: Hoare triple {135005#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135005#(<= main_~i~0 51)} is VALID [2022-04-28 03:06:46,348 INFO L290 TraceCheckUtils]: 109: Hoare triple {135005#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135006#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:46,348 INFO L290 TraceCheckUtils]: 110: Hoare triple {135006#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135006#(<= main_~i~0 52)} is VALID [2022-04-28 03:06:46,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {135006#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135007#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:46,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {135007#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135007#(<= main_~i~0 53)} is VALID [2022-04-28 03:06:46,349 INFO L290 TraceCheckUtils]: 113: Hoare triple {135007#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135008#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:46,349 INFO L290 TraceCheckUtils]: 114: Hoare triple {135008#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135008#(<= main_~i~0 54)} is VALID [2022-04-28 03:06:46,350 INFO L290 TraceCheckUtils]: 115: Hoare triple {135008#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135009#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:46,350 INFO L290 TraceCheckUtils]: 116: Hoare triple {135009#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135009#(<= main_~i~0 55)} is VALID [2022-04-28 03:06:46,350 INFO L290 TraceCheckUtils]: 117: Hoare triple {135009#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135010#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:46,350 INFO L290 TraceCheckUtils]: 118: Hoare triple {135010#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135010#(<= main_~i~0 56)} is VALID [2022-04-28 03:06:46,351 INFO L290 TraceCheckUtils]: 119: Hoare triple {135010#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135011#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:46,351 INFO L290 TraceCheckUtils]: 120: Hoare triple {135011#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135011#(<= main_~i~0 57)} is VALID [2022-04-28 03:06:46,351 INFO L290 TraceCheckUtils]: 121: Hoare triple {135011#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135012#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:46,352 INFO L290 TraceCheckUtils]: 122: Hoare triple {135012#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135012#(<= main_~i~0 58)} is VALID [2022-04-28 03:06:46,352 INFO L290 TraceCheckUtils]: 123: Hoare triple {135012#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135013#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:46,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {135013#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135013#(<= main_~i~0 59)} is VALID [2022-04-28 03:06:46,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {135013#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135014#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:46,353 INFO L290 TraceCheckUtils]: 126: Hoare triple {135014#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135014#(<= main_~i~0 60)} is VALID [2022-04-28 03:06:46,353 INFO L290 TraceCheckUtils]: 127: Hoare triple {135014#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135015#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:46,353 INFO L290 TraceCheckUtils]: 128: Hoare triple {135015#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135015#(<= main_~i~0 61)} is VALID [2022-04-28 03:06:46,353 INFO L290 TraceCheckUtils]: 129: Hoare triple {135015#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135016#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:46,354 INFO L290 TraceCheckUtils]: 130: Hoare triple {135016#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135016#(<= main_~i~0 62)} is VALID [2022-04-28 03:06:46,354 INFO L290 TraceCheckUtils]: 131: Hoare triple {135016#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135017#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:46,354 INFO L290 TraceCheckUtils]: 132: Hoare triple {135017#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135017#(<= main_~i~0 63)} is VALID [2022-04-28 03:06:46,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {135017#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135018#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:46,355 INFO L290 TraceCheckUtils]: 134: Hoare triple {135018#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135018#(<= main_~i~0 64)} is VALID [2022-04-28 03:06:46,355 INFO L290 TraceCheckUtils]: 135: Hoare triple {135018#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135019#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:46,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {135019#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135019#(<= main_~i~0 65)} is VALID [2022-04-28 03:06:46,356 INFO L290 TraceCheckUtils]: 137: Hoare triple {135019#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135020#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:46,356 INFO L290 TraceCheckUtils]: 138: Hoare triple {135020#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135020#(<= main_~i~0 66)} is VALID [2022-04-28 03:06:46,356 INFO L290 TraceCheckUtils]: 139: Hoare triple {135020#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135021#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:46,356 INFO L290 TraceCheckUtils]: 140: Hoare triple {135021#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135021#(<= main_~i~0 67)} is VALID [2022-04-28 03:06:46,357 INFO L290 TraceCheckUtils]: 141: Hoare triple {135021#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135022#(<= main_~i~0 68)} is VALID [2022-04-28 03:06:46,357 INFO L290 TraceCheckUtils]: 142: Hoare triple {135022#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135022#(<= main_~i~0 68)} is VALID [2022-04-28 03:06:46,357 INFO L290 TraceCheckUtils]: 143: Hoare triple {135022#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135023#(<= main_~i~0 69)} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 144: Hoare triple {135023#(<= main_~i~0 69)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:46,358 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:46,359 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-28 03:06:46,359 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-28 03:06:46,359 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-28 03:06:46,359 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-28 03:06:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:06:46,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 160: Hoare triple {134950#false} assume !false; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 159: Hoare triple {134950#false} assume 0 == ~cond; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 158: Hoare triple {134950#false} ~cond := #in~cond; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L272 TraceCheckUtils]: 157: Hoare triple {134950#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 156: Hoare triple {134950#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 155: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 154: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 153: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 152: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 151: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:50,276 INFO L290 TraceCheckUtils]: 150: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 149: Hoare triple {134950#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 148: Hoare triple {134950#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 147: Hoare triple {134950#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 146: Hoare triple {134950#false} #t~short5 := ~i~0 < 1024; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 145: Hoare triple {134950#false} ~i~0 := 0; {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 144: Hoare triple {135557#(< main_~i~0 1024)} assume !(~i~0 < 1024); {134950#false} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 143: Hoare triple {135561#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135557#(< main_~i~0 1024)} is VALID [2022-04-28 03:06:50,277 INFO L290 TraceCheckUtils]: 142: Hoare triple {135561#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135561#(< main_~i~0 1023)} is VALID [2022-04-28 03:06:50,278 INFO L290 TraceCheckUtils]: 141: Hoare triple {135568#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135561#(< main_~i~0 1023)} is VALID [2022-04-28 03:06:50,278 INFO L290 TraceCheckUtils]: 140: Hoare triple {135568#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135568#(< main_~i~0 1022)} is VALID [2022-04-28 03:06:50,278 INFO L290 TraceCheckUtils]: 139: Hoare triple {135575#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135568#(< main_~i~0 1022)} is VALID [2022-04-28 03:06:50,278 INFO L290 TraceCheckUtils]: 138: Hoare triple {135575#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135575#(< main_~i~0 1021)} is VALID [2022-04-28 03:06:50,279 INFO L290 TraceCheckUtils]: 137: Hoare triple {135582#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135575#(< main_~i~0 1021)} is VALID [2022-04-28 03:06:50,279 INFO L290 TraceCheckUtils]: 136: Hoare triple {135582#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135582#(< main_~i~0 1020)} is VALID [2022-04-28 03:06:50,279 INFO L290 TraceCheckUtils]: 135: Hoare triple {135589#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135582#(< main_~i~0 1020)} is VALID [2022-04-28 03:06:50,279 INFO L290 TraceCheckUtils]: 134: Hoare triple {135589#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135589#(< main_~i~0 1019)} is VALID [2022-04-28 03:06:50,280 INFO L290 TraceCheckUtils]: 133: Hoare triple {135596#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135589#(< main_~i~0 1019)} is VALID [2022-04-28 03:06:50,280 INFO L290 TraceCheckUtils]: 132: Hoare triple {135596#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135596#(< main_~i~0 1018)} is VALID [2022-04-28 03:06:50,280 INFO L290 TraceCheckUtils]: 131: Hoare triple {135603#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135596#(< main_~i~0 1018)} is VALID [2022-04-28 03:06:50,280 INFO L290 TraceCheckUtils]: 130: Hoare triple {135603#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135603#(< main_~i~0 1017)} is VALID [2022-04-28 03:06:50,280 INFO L290 TraceCheckUtils]: 129: Hoare triple {135610#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135603#(< main_~i~0 1017)} is VALID [2022-04-28 03:06:50,281 INFO L290 TraceCheckUtils]: 128: Hoare triple {135610#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135610#(< main_~i~0 1016)} is VALID [2022-04-28 03:06:50,281 INFO L290 TraceCheckUtils]: 127: Hoare triple {135617#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135610#(< main_~i~0 1016)} is VALID [2022-04-28 03:06:50,281 INFO L290 TraceCheckUtils]: 126: Hoare triple {135617#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135617#(< main_~i~0 1015)} is VALID [2022-04-28 03:06:50,281 INFO L290 TraceCheckUtils]: 125: Hoare triple {135624#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135617#(< main_~i~0 1015)} is VALID [2022-04-28 03:06:50,281 INFO L290 TraceCheckUtils]: 124: Hoare triple {135624#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135624#(< main_~i~0 1014)} is VALID [2022-04-28 03:06:50,282 INFO L290 TraceCheckUtils]: 123: Hoare triple {135631#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135624#(< main_~i~0 1014)} is VALID [2022-04-28 03:06:50,282 INFO L290 TraceCheckUtils]: 122: Hoare triple {135631#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135631#(< main_~i~0 1013)} is VALID [2022-04-28 03:06:50,282 INFO L290 TraceCheckUtils]: 121: Hoare triple {135638#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135631#(< main_~i~0 1013)} is VALID [2022-04-28 03:06:50,282 INFO L290 TraceCheckUtils]: 120: Hoare triple {135638#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135638#(< main_~i~0 1012)} is VALID [2022-04-28 03:06:50,283 INFO L290 TraceCheckUtils]: 119: Hoare triple {135645#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135638#(< main_~i~0 1012)} is VALID [2022-04-28 03:06:50,283 INFO L290 TraceCheckUtils]: 118: Hoare triple {135645#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135645#(< main_~i~0 1011)} is VALID [2022-04-28 03:06:50,283 INFO L290 TraceCheckUtils]: 117: Hoare triple {135652#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135645#(< main_~i~0 1011)} is VALID [2022-04-28 03:06:50,283 INFO L290 TraceCheckUtils]: 116: Hoare triple {135652#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135652#(< main_~i~0 1010)} is VALID [2022-04-28 03:06:50,284 INFO L290 TraceCheckUtils]: 115: Hoare triple {135659#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135652#(< main_~i~0 1010)} is VALID [2022-04-28 03:06:50,284 INFO L290 TraceCheckUtils]: 114: Hoare triple {135659#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135659#(< main_~i~0 1009)} is VALID [2022-04-28 03:06:50,284 INFO L290 TraceCheckUtils]: 113: Hoare triple {135666#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135659#(< main_~i~0 1009)} is VALID [2022-04-28 03:06:50,284 INFO L290 TraceCheckUtils]: 112: Hoare triple {135666#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135666#(< main_~i~0 1008)} is VALID [2022-04-28 03:06:50,284 INFO L290 TraceCheckUtils]: 111: Hoare triple {135673#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135666#(< main_~i~0 1008)} is VALID [2022-04-28 03:06:50,285 INFO L290 TraceCheckUtils]: 110: Hoare triple {135673#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135673#(< main_~i~0 1007)} is VALID [2022-04-28 03:06:50,285 INFO L290 TraceCheckUtils]: 109: Hoare triple {135680#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135673#(< main_~i~0 1007)} is VALID [2022-04-28 03:06:50,285 INFO L290 TraceCheckUtils]: 108: Hoare triple {135680#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135680#(< main_~i~0 1006)} is VALID [2022-04-28 03:06:50,285 INFO L290 TraceCheckUtils]: 107: Hoare triple {135687#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135680#(< main_~i~0 1006)} is VALID [2022-04-28 03:06:50,286 INFO L290 TraceCheckUtils]: 106: Hoare triple {135687#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135687#(< main_~i~0 1005)} is VALID [2022-04-28 03:06:50,286 INFO L290 TraceCheckUtils]: 105: Hoare triple {135694#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135687#(< main_~i~0 1005)} is VALID [2022-04-28 03:06:50,286 INFO L290 TraceCheckUtils]: 104: Hoare triple {135694#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135694#(< main_~i~0 1004)} is VALID [2022-04-28 03:06:50,286 INFO L290 TraceCheckUtils]: 103: Hoare triple {135701#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135694#(< main_~i~0 1004)} is VALID [2022-04-28 03:06:50,286 INFO L290 TraceCheckUtils]: 102: Hoare triple {135701#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135701#(< main_~i~0 1003)} is VALID [2022-04-28 03:06:50,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {135708#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135701#(< main_~i~0 1003)} is VALID [2022-04-28 03:06:50,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {135708#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135708#(< main_~i~0 1002)} is VALID [2022-04-28 03:06:50,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {135715#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135708#(< main_~i~0 1002)} is VALID [2022-04-28 03:06:50,287 INFO L290 TraceCheckUtils]: 98: Hoare triple {135715#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135715#(< main_~i~0 1001)} is VALID [2022-04-28 03:06:50,288 INFO L290 TraceCheckUtils]: 97: Hoare triple {135722#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135715#(< main_~i~0 1001)} is VALID [2022-04-28 03:06:50,288 INFO L290 TraceCheckUtils]: 96: Hoare triple {135722#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135722#(< main_~i~0 1000)} is VALID [2022-04-28 03:06:50,288 INFO L290 TraceCheckUtils]: 95: Hoare triple {135729#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135722#(< main_~i~0 1000)} is VALID [2022-04-28 03:06:50,288 INFO L290 TraceCheckUtils]: 94: Hoare triple {135729#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135729#(< main_~i~0 999)} is VALID [2022-04-28 03:06:50,289 INFO L290 TraceCheckUtils]: 93: Hoare triple {135736#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135729#(< main_~i~0 999)} is VALID [2022-04-28 03:06:50,289 INFO L290 TraceCheckUtils]: 92: Hoare triple {135736#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135736#(< main_~i~0 998)} is VALID [2022-04-28 03:06:50,289 INFO L290 TraceCheckUtils]: 91: Hoare triple {135743#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135736#(< main_~i~0 998)} is VALID [2022-04-28 03:06:50,289 INFO L290 TraceCheckUtils]: 90: Hoare triple {135743#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135743#(< main_~i~0 997)} is VALID [2022-04-28 03:06:50,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {135750#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135743#(< main_~i~0 997)} is VALID [2022-04-28 03:06:50,290 INFO L290 TraceCheckUtils]: 88: Hoare triple {135750#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135750#(< main_~i~0 996)} is VALID [2022-04-28 03:06:50,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {135757#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135750#(< main_~i~0 996)} is VALID [2022-04-28 03:06:50,290 INFO L290 TraceCheckUtils]: 86: Hoare triple {135757#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135757#(< main_~i~0 995)} is VALID [2022-04-28 03:06:50,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {135764#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135757#(< main_~i~0 995)} is VALID [2022-04-28 03:06:50,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {135764#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135764#(< main_~i~0 994)} is VALID [2022-04-28 03:06:50,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {135771#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135764#(< main_~i~0 994)} is VALID [2022-04-28 03:06:50,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {135771#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135771#(< main_~i~0 993)} is VALID [2022-04-28 03:06:50,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {135778#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135771#(< main_~i~0 993)} is VALID [2022-04-28 03:06:50,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {135778#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135778#(< main_~i~0 992)} is VALID [2022-04-28 03:06:50,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {135785#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135778#(< main_~i~0 992)} is VALID [2022-04-28 03:06:50,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {135785#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135785#(< main_~i~0 991)} is VALID [2022-04-28 03:06:50,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {135792#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135785#(< main_~i~0 991)} is VALID [2022-04-28 03:06:50,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {135792#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135792#(< main_~i~0 990)} is VALID [2022-04-28 03:06:50,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {135799#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135792#(< main_~i~0 990)} is VALID [2022-04-28 03:06:50,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {135799#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135799#(< main_~i~0 989)} is VALID [2022-04-28 03:06:50,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {135806#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135799#(< main_~i~0 989)} is VALID [2022-04-28 03:06:50,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {135806#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135806#(< main_~i~0 988)} is VALID [2022-04-28 03:06:50,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {135813#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135806#(< main_~i~0 988)} is VALID [2022-04-28 03:06:50,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {135813#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135813#(< main_~i~0 987)} is VALID [2022-04-28 03:06:50,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {135820#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135813#(< main_~i~0 987)} is VALID [2022-04-28 03:06:50,294 INFO L290 TraceCheckUtils]: 68: Hoare triple {135820#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135820#(< main_~i~0 986)} is VALID [2022-04-28 03:06:50,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {135827#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135820#(< main_~i~0 986)} is VALID [2022-04-28 03:06:50,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {135827#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135827#(< main_~i~0 985)} is VALID [2022-04-28 03:06:50,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {135834#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135827#(< main_~i~0 985)} is VALID [2022-04-28 03:06:50,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {135834#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135834#(< main_~i~0 984)} is VALID [2022-04-28 03:06:50,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {135841#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135834#(< main_~i~0 984)} is VALID [2022-04-28 03:06:50,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {135841#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135841#(< main_~i~0 983)} is VALID [2022-04-28 03:06:50,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {135848#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135841#(< main_~i~0 983)} is VALID [2022-04-28 03:06:50,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {135848#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135848#(< main_~i~0 982)} is VALID [2022-04-28 03:06:50,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {135855#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135848#(< main_~i~0 982)} is VALID [2022-04-28 03:06:50,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {135855#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135855#(< main_~i~0 981)} is VALID [2022-04-28 03:06:50,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {135862#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135855#(< main_~i~0 981)} is VALID [2022-04-28 03:06:50,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {135862#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135862#(< main_~i~0 980)} is VALID [2022-04-28 03:06:50,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {135869#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135862#(< main_~i~0 980)} is VALID [2022-04-28 03:06:50,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {135869#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135869#(< main_~i~0 979)} is VALID [2022-04-28 03:06:50,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {135876#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135869#(< main_~i~0 979)} is VALID [2022-04-28 03:06:50,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {135876#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135876#(< main_~i~0 978)} is VALID [2022-04-28 03:06:50,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {135883#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135876#(< main_~i~0 978)} is VALID [2022-04-28 03:06:50,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {135883#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135883#(< main_~i~0 977)} is VALID [2022-04-28 03:06:50,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {135890#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135883#(< main_~i~0 977)} is VALID [2022-04-28 03:06:50,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {135890#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135890#(< main_~i~0 976)} is VALID [2022-04-28 03:06:50,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {135897#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135890#(< main_~i~0 976)} is VALID [2022-04-28 03:06:50,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {135897#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135897#(< main_~i~0 975)} is VALID [2022-04-28 03:06:50,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {135904#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135897#(< main_~i~0 975)} is VALID [2022-04-28 03:06:50,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {135904#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135904#(< main_~i~0 974)} is VALID [2022-04-28 03:06:50,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {135911#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135904#(< main_~i~0 974)} is VALID [2022-04-28 03:06:50,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {135911#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135911#(< main_~i~0 973)} is VALID [2022-04-28 03:06:50,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {135918#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135911#(< main_~i~0 973)} is VALID [2022-04-28 03:06:50,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {135918#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135918#(< main_~i~0 972)} is VALID [2022-04-28 03:06:50,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {135925#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135918#(< main_~i~0 972)} is VALID [2022-04-28 03:06:50,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {135925#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135925#(< main_~i~0 971)} is VALID [2022-04-28 03:06:50,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {135932#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135925#(< main_~i~0 971)} is VALID [2022-04-28 03:06:50,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {135932#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135932#(< main_~i~0 970)} is VALID [2022-04-28 03:06:50,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {135939#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135932#(< main_~i~0 970)} is VALID [2022-04-28 03:06:50,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {135939#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135939#(< main_~i~0 969)} is VALID [2022-04-28 03:06:50,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {135946#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135939#(< main_~i~0 969)} is VALID [2022-04-28 03:06:50,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {135946#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135946#(< main_~i~0 968)} is VALID [2022-04-28 03:06:50,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {135953#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135946#(< main_~i~0 968)} is VALID [2022-04-28 03:06:50,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {135953#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135953#(< main_~i~0 967)} is VALID [2022-04-28 03:06:50,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {135960#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135953#(< main_~i~0 967)} is VALID [2022-04-28 03:06:50,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {135960#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135960#(< main_~i~0 966)} is VALID [2022-04-28 03:06:50,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {135967#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135960#(< main_~i~0 966)} is VALID [2022-04-28 03:06:50,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {135967#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135967#(< main_~i~0 965)} is VALID [2022-04-28 03:06:50,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {135974#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135967#(< main_~i~0 965)} is VALID [2022-04-28 03:06:50,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {135974#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135974#(< main_~i~0 964)} is VALID [2022-04-28 03:06:50,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {135981#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135974#(< main_~i~0 964)} is VALID [2022-04-28 03:06:50,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {135981#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135981#(< main_~i~0 963)} is VALID [2022-04-28 03:06:50,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {135988#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135981#(< main_~i~0 963)} is VALID [2022-04-28 03:06:50,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {135988#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135988#(< main_~i~0 962)} is VALID [2022-04-28 03:06:50,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {135995#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135988#(< main_~i~0 962)} is VALID [2022-04-28 03:06:50,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {135995#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {135995#(< main_~i~0 961)} is VALID [2022-04-28 03:06:50,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {136002#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {135995#(< main_~i~0 961)} is VALID [2022-04-28 03:06:50,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {136002#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136002#(< main_~i~0 960)} is VALID [2022-04-28 03:06:50,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {136009#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136002#(< main_~i~0 960)} is VALID [2022-04-28 03:06:50,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {136009#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136009#(< main_~i~0 959)} is VALID [2022-04-28 03:06:50,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {136016#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136009#(< main_~i~0 959)} is VALID [2022-04-28 03:06:50,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {136016#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136016#(< main_~i~0 958)} is VALID [2022-04-28 03:06:50,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {136023#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136016#(< main_~i~0 958)} is VALID [2022-04-28 03:06:50,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {136023#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136023#(< main_~i~0 957)} is VALID [2022-04-28 03:06:50,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {136030#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136023#(< main_~i~0 957)} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {136030#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136030#(< main_~i~0 956)} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {136037#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {136030#(< main_~i~0 956)} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {136037#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {136037#(< main_~i~0 955)} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {134949#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {136037#(< main_~i~0 955)} is VALID [2022-04-28 03:06:50,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {134949#true} call #t~ret6 := main(); {134949#true} is VALID [2022-04-28 03:06:50,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134949#true} {134949#true} #64#return; {134949#true} is VALID [2022-04-28 03:06:50,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {134949#true} assume true; {134949#true} is VALID [2022-04-28 03:06:50,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {134949#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(12, 2); {134949#true} is VALID [2022-04-28 03:06:50,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {134949#true} call ULTIMATE.init(); {134949#true} is VALID [2022-04-28 03:06:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4771 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:06:50,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501683839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:50,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:50,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 72, 72] total 144 [2022-04-28 03:06:50,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:50,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513541397] [2022-04-28 03:06:50,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513541397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:50,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:50,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-28 03:06:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417874470] [2022-04-28 03:06:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 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 161 [2022-04-28 03:06:50,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:50,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:50,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-28 03:06:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-28 03:06:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10155, Invalid=10437, Unknown=0, NotChecked=0, Total=20592 [2022-04-28 03:06:50,374 INFO L87 Difference]: Start difference. First operand 162 states and 166 transitions. Second operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:09,127 INFO L93 Difference]: Finished difference Result 523 states and 667 transitions. [2022-04-28 03:07:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-04-28 03:07:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 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 161 [2022-04-28 03:07:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 658 transitions. [2022-04-28 03:07:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 658 transitions. [2022-04-28 03:07:09,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 658 transitions. [2022-04-28 03:07:09,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 658 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:09,451 INFO L225 Difference]: With dead ends: 523 [2022-04-28 03:07:09,451 INFO L226 Difference]: Without dead ends: 506 [2022-04-28 03:07:09,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=20166, Invalid=25416, Unknown=0, NotChecked=0, Total=45582 [2022-04-28 03:07:09,453 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2094 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:09,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2094 Valid, 32 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:07:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-04-28 03:07:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 164. [2022-04-28 03:07:10,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:10,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:10,357 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:10,357 INFO L87 Difference]: Start difference. First operand 506 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:10,365 INFO L93 Difference]: Finished difference Result 506 states and 646 transitions. [2022-04-28 03:07:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 646 transitions. [2022-04-28 03:07:10,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:10,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:10,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 506 states. [2022-04-28 03:07:10,366 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 506 states. [2022-04-28 03:07:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:10,373 INFO L93 Difference]: Finished difference Result 506 states and 646 transitions. [2022-04-28 03:07:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 646 transitions. [2022-04-28 03:07:10,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:10,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:10,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:10,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-28 03:07:10,375 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 161 [2022-04-28 03:07:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:10,375 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-28 03:07:10,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 72 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:10,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-28 03:07:10,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-28 03:07:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 03:07:10,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:10,853 INFO L195 NwaCegarLoop]: trace histogram [70, 70, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:10,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-28 03:07:11,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:11,067 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1746702065, now seen corresponding path program 141 times [2022-04-28 03:07:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:11,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626144644] [2022-04-28 03:07:11,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:11,081 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:07:11,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1746702065, now seen corresponding path program 142 times [2022-04-28 03:07:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:11,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042328808] [2022-04-28 03:07:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:12,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {138663#(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(12, 2); {138587#true} is VALID [2022-04-28 03:07:12,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {138587#true} assume true; {138587#true} is VALID [2022-04-28 03:07:12,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138587#true} {138587#true} #64#return; {138587#true} is VALID [2022-04-28 03:07:12,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {138587#true} call ULTIMATE.init(); {138663#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:12,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {138663#(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(12, 2); {138587#true} is VALID [2022-04-28 03:07:12,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {138587#true} assume true; {138587#true} is VALID [2022-04-28 03:07:12,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138587#true} {138587#true} #64#return; {138587#true} is VALID [2022-04-28 03:07:12,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {138587#true} call #t~ret6 := main(); {138587#true} is VALID [2022-04-28 03:07:12,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {138587#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {138592#(= main_~i~0 0)} is VALID [2022-04-28 03:07:12,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {138592#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138592#(= main_~i~0 0)} is VALID [2022-04-28 03:07:12,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {138592#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138593#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:12,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {138593#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138593#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:12,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {138593#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138594#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:12,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {138594#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138594#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:12,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {138594#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138595#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:12,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {138595#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138595#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:12,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {138595#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138596#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:12,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {138596#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138596#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:12,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {138596#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138597#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:12,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {138597#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138597#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:12,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {138597#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138598#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:12,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {138598#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138598#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:12,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {138598#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138599#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:12,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {138599#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138599#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:12,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {138599#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138600#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:12,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {138600#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138600#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:12,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {138600#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138601#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:12,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {138601#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138601#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:12,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {138601#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138602#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:12,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {138602#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138602#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:12,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {138602#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138603#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:12,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {138603#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138603#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:12,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {138603#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138604#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:12,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {138604#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138604#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:12,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {138604#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138605#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:12,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {138605#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138605#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:12,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {138605#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138606#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:12,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {138606#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138606#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:12,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {138606#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138607#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:12,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {138607#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138607#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:12,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {138607#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138608#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:12,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {138608#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138608#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:12,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {138608#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138609#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:12,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {138609#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138609#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:12,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {138609#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138610#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:12,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {138610#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138610#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:12,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {138610#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138611#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:12,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {138611#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138611#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:12,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {138611#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138612#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:12,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {138612#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138612#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:12,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {138612#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138613#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:12,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {138613#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138613#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:12,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {138613#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138614#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:12,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {138614#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138614#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:12,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {138614#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138615#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:12,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {138615#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138615#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:12,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {138615#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138616#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:12,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {138616#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138616#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:12,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {138616#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138617#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:12,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {138617#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138617#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:12,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {138617#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138618#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:12,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {138618#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138618#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:12,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {138618#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138619#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:12,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {138619#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138619#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:12,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {138619#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138620#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:12,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {138620#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138620#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:12,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {138620#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138621#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:12,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {138621#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138621#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:12,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {138621#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138622#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:12,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {138622#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138622#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:12,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {138622#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138623#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:12,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {138623#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138623#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:12,470 INFO L290 TraceCheckUtils]: 69: Hoare triple {138623#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138624#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:12,470 INFO L290 TraceCheckUtils]: 70: Hoare triple {138624#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138624#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:12,470 INFO L290 TraceCheckUtils]: 71: Hoare triple {138624#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138625#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:12,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {138625#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138625#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:12,471 INFO L290 TraceCheckUtils]: 73: Hoare triple {138625#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138626#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:12,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {138626#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138626#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:12,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {138626#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138627#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:12,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {138627#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138627#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:12,472 INFO L290 TraceCheckUtils]: 77: Hoare triple {138627#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138628#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:12,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {138628#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138628#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:12,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {138628#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138629#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:12,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {138629#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138629#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:12,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {138629#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138630#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:12,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {138630#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138630#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:12,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {138630#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138631#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:12,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {138631#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138631#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:12,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {138631#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138632#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:12,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {138632#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138632#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:12,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {138632#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138633#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:12,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {138633#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138633#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:12,474 INFO L290 TraceCheckUtils]: 89: Hoare triple {138633#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138634#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:12,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {138634#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138634#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:12,475 INFO L290 TraceCheckUtils]: 91: Hoare triple {138634#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138635#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:12,475 INFO L290 TraceCheckUtils]: 92: Hoare triple {138635#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138635#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:12,475 INFO L290 TraceCheckUtils]: 93: Hoare triple {138635#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138636#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:12,475 INFO L290 TraceCheckUtils]: 94: Hoare triple {138636#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138636#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:12,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {138636#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138637#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:12,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {138637#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138637#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:12,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {138637#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138638#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:12,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {138638#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138638#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:12,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {138638#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138639#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:12,477 INFO L290 TraceCheckUtils]: 100: Hoare triple {138639#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138639#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:12,477 INFO L290 TraceCheckUtils]: 101: Hoare triple {138639#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138640#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:12,477 INFO L290 TraceCheckUtils]: 102: Hoare triple {138640#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138640#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:12,477 INFO L290 TraceCheckUtils]: 103: Hoare triple {138640#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138641#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:12,478 INFO L290 TraceCheckUtils]: 104: Hoare triple {138641#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138641#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:12,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {138641#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138642#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:12,478 INFO L290 TraceCheckUtils]: 106: Hoare triple {138642#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138642#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:12,478 INFO L290 TraceCheckUtils]: 107: Hoare triple {138642#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138643#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:12,478 INFO L290 TraceCheckUtils]: 108: Hoare triple {138643#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138643#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:12,479 INFO L290 TraceCheckUtils]: 109: Hoare triple {138643#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138644#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:12,479 INFO L290 TraceCheckUtils]: 110: Hoare triple {138644#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138644#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:12,479 INFO L290 TraceCheckUtils]: 111: Hoare triple {138644#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138645#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:12,479 INFO L290 TraceCheckUtils]: 112: Hoare triple {138645#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138645#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:12,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {138645#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138646#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:12,480 INFO L290 TraceCheckUtils]: 114: Hoare triple {138646#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138646#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:12,480 INFO L290 TraceCheckUtils]: 115: Hoare triple {138646#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138647#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:12,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {138647#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138647#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:12,481 INFO L290 TraceCheckUtils]: 117: Hoare triple {138647#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138648#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:12,481 INFO L290 TraceCheckUtils]: 118: Hoare triple {138648#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138648#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:12,481 INFO L290 TraceCheckUtils]: 119: Hoare triple {138648#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138649#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:12,481 INFO L290 TraceCheckUtils]: 120: Hoare triple {138649#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138649#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:12,481 INFO L290 TraceCheckUtils]: 121: Hoare triple {138649#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138650#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:12,482 INFO L290 TraceCheckUtils]: 122: Hoare triple {138650#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138650#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:12,482 INFO L290 TraceCheckUtils]: 123: Hoare triple {138650#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138651#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:12,482 INFO L290 TraceCheckUtils]: 124: Hoare triple {138651#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138651#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:12,482 INFO L290 TraceCheckUtils]: 125: Hoare triple {138651#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138652#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:12,482 INFO L290 TraceCheckUtils]: 126: Hoare triple {138652#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138652#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:12,483 INFO L290 TraceCheckUtils]: 127: Hoare triple {138652#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138653#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:12,483 INFO L290 TraceCheckUtils]: 128: Hoare triple {138653#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138653#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:12,483 INFO L290 TraceCheckUtils]: 129: Hoare triple {138653#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138654#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:12,483 INFO L290 TraceCheckUtils]: 130: Hoare triple {138654#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138654#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:12,484 INFO L290 TraceCheckUtils]: 131: Hoare triple {138654#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138655#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:12,484 INFO L290 TraceCheckUtils]: 132: Hoare triple {138655#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138655#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:12,484 INFO L290 TraceCheckUtils]: 133: Hoare triple {138655#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138656#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:12,484 INFO L290 TraceCheckUtils]: 134: Hoare triple {138656#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138656#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:12,484 INFO L290 TraceCheckUtils]: 135: Hoare triple {138656#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138657#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:12,485 INFO L290 TraceCheckUtils]: 136: Hoare triple {138657#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138657#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:12,485 INFO L290 TraceCheckUtils]: 137: Hoare triple {138657#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138658#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:12,485 INFO L290 TraceCheckUtils]: 138: Hoare triple {138658#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138658#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:12,485 INFO L290 TraceCheckUtils]: 139: Hoare triple {138658#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138659#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:12,486 INFO L290 TraceCheckUtils]: 140: Hoare triple {138659#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138659#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:12,486 INFO L290 TraceCheckUtils]: 141: Hoare triple {138659#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138660#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:12,486 INFO L290 TraceCheckUtils]: 142: Hoare triple {138660#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138660#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:12,486 INFO L290 TraceCheckUtils]: 143: Hoare triple {138660#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138661#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:12,486 INFO L290 TraceCheckUtils]: 144: Hoare triple {138661#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138661#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 145: Hoare triple {138661#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138662#(<= main_~i~0 70)} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 146: Hoare triple {138662#(<= main_~i~0 70)} assume !(~i~0 < 1024); {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 147: Hoare triple {138588#false} ~i~0 := 0; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 148: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 149: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 150: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 151: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 152: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 153: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:12,487 INFO L290 TraceCheckUtils]: 154: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 155: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 156: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 157: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 158: Hoare triple {138588#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L272 TraceCheckUtils]: 159: Hoare triple {138588#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 160: Hoare triple {138588#false} ~cond := #in~cond; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 161: Hoare triple {138588#false} assume 0 == ~cond; {138588#false} is VALID [2022-04-28 03:07:12,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {138588#false} assume !false; {138588#false} is VALID [2022-04-28 03:07:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:07:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042328808] [2022-04-28 03:07:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042328808] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144973611] [2022-04-28 03:07:12,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:12,490 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:07:12,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-28 03:07:13,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:13,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:13,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 03:07:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:13,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:13,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {138587#true} call ULTIMATE.init(); {138587#true} is VALID [2022-04-28 03:07:13,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {138587#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(12, 2); {138587#true} is VALID [2022-04-28 03:07:13,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {138587#true} assume true; {138587#true} is VALID [2022-04-28 03:07:13,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138587#true} {138587#true} #64#return; {138587#true} is VALID [2022-04-28 03:07:13,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {138587#true} call #t~ret6 := main(); {138587#true} is VALID [2022-04-28 03:07:13,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {138587#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {138682#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:13,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {138682#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138682#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:13,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {138682#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138593#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:13,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {138593#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138593#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:13,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {138593#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138594#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:13,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {138594#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138594#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:13,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {138594#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138595#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:13,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {138595#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138595#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:13,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {138595#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138596#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:13,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {138596#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138596#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:13,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {138596#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138597#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:13,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {138597#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138597#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:13,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {138597#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138598#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:13,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {138598#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138598#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:13,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {138598#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138599#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:13,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {138599#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138599#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:13,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {138599#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138600#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:13,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {138600#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138600#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:13,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {138600#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138601#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:13,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {138601#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138601#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:13,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {138601#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138602#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:13,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {138602#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138602#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:13,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {138602#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138603#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:13,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {138603#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138603#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:13,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {138603#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138604#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:13,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {138604#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138604#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:13,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {138604#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138605#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:13,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {138605#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138605#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:13,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {138605#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138606#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:13,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {138606#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138606#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:13,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {138606#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138607#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:13,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {138607#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138607#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:13,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {138607#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138608#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:13,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {138608#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138608#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:13,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {138608#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138609#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:13,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {138609#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138609#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:13,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {138609#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138610#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:13,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {138610#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138610#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:13,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {138610#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138611#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:13,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {138611#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138611#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:13,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {138611#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138612#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:13,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {138612#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138612#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:13,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {138612#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138613#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:13,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {138613#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138613#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:13,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {138613#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138614#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:13,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {138614#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138614#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:13,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {138614#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138615#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:13,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {138615#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138615#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:13,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {138615#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138616#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:13,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {138616#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138616#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:13,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {138616#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138617#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:13,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {138617#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138617#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:13,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {138617#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138618#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:13,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {138618#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138618#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:13,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {138618#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138619#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:13,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {138619#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138619#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:13,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {138619#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138620#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:13,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {138620#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138620#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:13,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {138620#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138621#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:13,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {138621#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138621#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:13,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {138621#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138622#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:13,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {138622#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138622#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:13,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {138622#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138623#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:13,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {138623#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138623#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:13,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {138623#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138624#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:13,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {138624#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138624#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:13,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {138624#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138625#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:13,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {138625#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138625#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:13,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {138625#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138626#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:13,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {138626#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138626#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:13,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {138626#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138627#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:13,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {138627#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138627#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:13,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {138627#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138628#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:13,896 INFO L290 TraceCheckUtils]: 78: Hoare triple {138628#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138628#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:13,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {138628#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138629#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:13,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {138629#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138629#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:13,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {138629#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138630#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:13,898 INFO L290 TraceCheckUtils]: 82: Hoare triple {138630#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138630#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:13,898 INFO L290 TraceCheckUtils]: 83: Hoare triple {138630#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138631#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:13,898 INFO L290 TraceCheckUtils]: 84: Hoare triple {138631#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138631#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:13,898 INFO L290 TraceCheckUtils]: 85: Hoare triple {138631#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138632#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:13,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {138632#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138632#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:13,899 INFO L290 TraceCheckUtils]: 87: Hoare triple {138632#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138633#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:13,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {138633#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138633#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:13,900 INFO L290 TraceCheckUtils]: 89: Hoare triple {138633#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138634#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:13,900 INFO L290 TraceCheckUtils]: 90: Hoare triple {138634#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138634#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:13,900 INFO L290 TraceCheckUtils]: 91: Hoare triple {138634#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138635#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:13,900 INFO L290 TraceCheckUtils]: 92: Hoare triple {138635#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138635#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:13,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {138635#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138636#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:13,901 INFO L290 TraceCheckUtils]: 94: Hoare triple {138636#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138636#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:13,901 INFO L290 TraceCheckUtils]: 95: Hoare triple {138636#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138637#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:13,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {138637#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138637#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:13,902 INFO L290 TraceCheckUtils]: 97: Hoare triple {138637#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138638#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:13,902 INFO L290 TraceCheckUtils]: 98: Hoare triple {138638#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138638#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:13,902 INFO L290 TraceCheckUtils]: 99: Hoare triple {138638#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138639#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:13,903 INFO L290 TraceCheckUtils]: 100: Hoare triple {138639#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138639#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:13,903 INFO L290 TraceCheckUtils]: 101: Hoare triple {138639#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138640#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:13,903 INFO L290 TraceCheckUtils]: 102: Hoare triple {138640#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138640#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:13,903 INFO L290 TraceCheckUtils]: 103: Hoare triple {138640#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138641#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:13,904 INFO L290 TraceCheckUtils]: 104: Hoare triple {138641#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138641#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:13,904 INFO L290 TraceCheckUtils]: 105: Hoare triple {138641#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138642#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:13,904 INFO L290 TraceCheckUtils]: 106: Hoare triple {138642#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138642#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:13,905 INFO L290 TraceCheckUtils]: 107: Hoare triple {138642#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138643#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:13,905 INFO L290 TraceCheckUtils]: 108: Hoare triple {138643#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138643#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:13,905 INFO L290 TraceCheckUtils]: 109: Hoare triple {138643#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138644#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:13,905 INFO L290 TraceCheckUtils]: 110: Hoare triple {138644#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138644#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:13,906 INFO L290 TraceCheckUtils]: 111: Hoare triple {138644#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138645#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:13,906 INFO L290 TraceCheckUtils]: 112: Hoare triple {138645#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138645#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:13,906 INFO L290 TraceCheckUtils]: 113: Hoare triple {138645#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138646#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:13,906 INFO L290 TraceCheckUtils]: 114: Hoare triple {138646#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138646#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:13,907 INFO L290 TraceCheckUtils]: 115: Hoare triple {138646#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138647#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:13,907 INFO L290 TraceCheckUtils]: 116: Hoare triple {138647#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138647#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:13,907 INFO L290 TraceCheckUtils]: 117: Hoare triple {138647#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138648#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:13,908 INFO L290 TraceCheckUtils]: 118: Hoare triple {138648#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138648#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:13,908 INFO L290 TraceCheckUtils]: 119: Hoare triple {138648#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138649#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:13,908 INFO L290 TraceCheckUtils]: 120: Hoare triple {138649#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138649#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:13,908 INFO L290 TraceCheckUtils]: 121: Hoare triple {138649#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138650#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:13,909 INFO L290 TraceCheckUtils]: 122: Hoare triple {138650#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138650#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:13,909 INFO L290 TraceCheckUtils]: 123: Hoare triple {138650#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138651#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:13,909 INFO L290 TraceCheckUtils]: 124: Hoare triple {138651#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138651#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:13,910 INFO L290 TraceCheckUtils]: 125: Hoare triple {138651#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138652#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:13,910 INFO L290 TraceCheckUtils]: 126: Hoare triple {138652#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138652#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:13,910 INFO L290 TraceCheckUtils]: 127: Hoare triple {138652#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138653#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:13,910 INFO L290 TraceCheckUtils]: 128: Hoare triple {138653#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138653#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:13,911 INFO L290 TraceCheckUtils]: 129: Hoare triple {138653#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138654#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:13,911 INFO L290 TraceCheckUtils]: 130: Hoare triple {138654#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138654#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:13,911 INFO L290 TraceCheckUtils]: 131: Hoare triple {138654#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138655#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:13,911 INFO L290 TraceCheckUtils]: 132: Hoare triple {138655#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138655#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:13,912 INFO L290 TraceCheckUtils]: 133: Hoare triple {138655#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138656#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:13,912 INFO L290 TraceCheckUtils]: 134: Hoare triple {138656#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138656#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:13,912 INFO L290 TraceCheckUtils]: 135: Hoare triple {138656#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138657#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:13,913 INFO L290 TraceCheckUtils]: 136: Hoare triple {138657#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138657#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:13,913 INFO L290 TraceCheckUtils]: 137: Hoare triple {138657#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138658#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:13,913 INFO L290 TraceCheckUtils]: 138: Hoare triple {138658#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138658#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:13,913 INFO L290 TraceCheckUtils]: 139: Hoare triple {138658#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138659#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:13,914 INFO L290 TraceCheckUtils]: 140: Hoare triple {138659#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138659#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:13,914 INFO L290 TraceCheckUtils]: 141: Hoare triple {138659#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138660#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:13,914 INFO L290 TraceCheckUtils]: 142: Hoare triple {138660#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138660#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:13,915 INFO L290 TraceCheckUtils]: 143: Hoare triple {138660#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138661#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:13,915 INFO L290 TraceCheckUtils]: 144: Hoare triple {138661#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {138661#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:13,915 INFO L290 TraceCheckUtils]: 145: Hoare triple {138661#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {138662#(<= main_~i~0 70)} is VALID [2022-04-28 03:07:13,915 INFO L290 TraceCheckUtils]: 146: Hoare triple {138662#(<= main_~i~0 70)} assume !(~i~0 < 1024); {138588#false} is VALID [2022-04-28 03:07:13,915 INFO L290 TraceCheckUtils]: 147: Hoare triple {138588#false} ~i~0 := 0; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 148: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 149: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 150: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 151: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 152: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 153: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 154: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 155: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 156: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 157: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 158: Hoare triple {138588#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L272 TraceCheckUtils]: 159: Hoare triple {138588#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 160: Hoare triple {138588#false} ~cond := #in~cond; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 161: Hoare triple {138588#false} assume 0 == ~cond; {138588#false} is VALID [2022-04-28 03:07:13,916 INFO L290 TraceCheckUtils]: 162: Hoare triple {138588#false} assume !false; {138588#false} is VALID [2022-04-28 03:07:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:07:13,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:17,434 INFO L290 TraceCheckUtils]: 162: Hoare triple {138588#false} assume !false; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 161: Hoare triple {138588#false} assume 0 == ~cond; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 160: Hoare triple {138588#false} ~cond := #in~cond; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L272 TraceCheckUtils]: 159: Hoare triple {138588#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 158: Hoare triple {138588#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 157: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 156: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 155: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 154: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 153: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 152: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 151: Hoare triple {138588#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 150: Hoare triple {138588#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 149: Hoare triple {138588#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 148: Hoare triple {138588#false} #t~short5 := ~i~0 < 1024; {138588#false} is VALID [2022-04-28 03:07:17,435 INFO L290 TraceCheckUtils]: 147: Hoare triple {138588#false} ~i~0 := 0; {138588#false} is VALID [2022-04-28 03:07:17,436 INFO L290 TraceCheckUtils]: 146: Hoare triple {139202#(< main_~i~0 1024)} assume !(~i~0 < 1024); {138588#false} is VALID [2022-04-28 03:07:17,436 INFO L290 TraceCheckUtils]: 145: Hoare triple {139206#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139202#(< main_~i~0 1024)} is VALID [2022-04-28 03:07:17,436 INFO L290 TraceCheckUtils]: 144: Hoare triple {139206#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139206#(< main_~i~0 1023)} is VALID [2022-04-28 03:07:17,436 INFO L290 TraceCheckUtils]: 143: Hoare triple {139213#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139206#(< main_~i~0 1023)} is VALID [2022-04-28 03:07:17,437 INFO L290 TraceCheckUtils]: 142: Hoare triple {139213#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139213#(< main_~i~0 1022)} is VALID [2022-04-28 03:07:17,437 INFO L290 TraceCheckUtils]: 141: Hoare triple {139220#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139213#(< main_~i~0 1022)} is VALID [2022-04-28 03:07:17,437 INFO L290 TraceCheckUtils]: 140: Hoare triple {139220#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139220#(< main_~i~0 1021)} is VALID [2022-04-28 03:07:17,437 INFO L290 TraceCheckUtils]: 139: Hoare triple {139227#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139220#(< main_~i~0 1021)} is VALID [2022-04-28 03:07:17,438 INFO L290 TraceCheckUtils]: 138: Hoare triple {139227#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139227#(< main_~i~0 1020)} is VALID [2022-04-28 03:07:17,438 INFO L290 TraceCheckUtils]: 137: Hoare triple {139234#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139227#(< main_~i~0 1020)} is VALID [2022-04-28 03:07:17,438 INFO L290 TraceCheckUtils]: 136: Hoare triple {139234#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139234#(< main_~i~0 1019)} is VALID [2022-04-28 03:07:17,438 INFO L290 TraceCheckUtils]: 135: Hoare triple {139241#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139234#(< main_~i~0 1019)} is VALID [2022-04-28 03:07:17,438 INFO L290 TraceCheckUtils]: 134: Hoare triple {139241#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139241#(< main_~i~0 1018)} is VALID [2022-04-28 03:07:17,439 INFO L290 TraceCheckUtils]: 133: Hoare triple {139248#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139241#(< main_~i~0 1018)} is VALID [2022-04-28 03:07:17,439 INFO L290 TraceCheckUtils]: 132: Hoare triple {139248#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139248#(< main_~i~0 1017)} is VALID [2022-04-28 03:07:17,439 INFO L290 TraceCheckUtils]: 131: Hoare triple {139255#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139248#(< main_~i~0 1017)} is VALID [2022-04-28 03:07:17,439 INFO L290 TraceCheckUtils]: 130: Hoare triple {139255#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139255#(< main_~i~0 1016)} is VALID [2022-04-28 03:07:17,440 INFO L290 TraceCheckUtils]: 129: Hoare triple {139262#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139255#(< main_~i~0 1016)} is VALID [2022-04-28 03:07:17,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {139262#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139262#(< main_~i~0 1015)} is VALID [2022-04-28 03:07:17,440 INFO L290 TraceCheckUtils]: 127: Hoare triple {139269#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139262#(< main_~i~0 1015)} is VALID [2022-04-28 03:07:17,440 INFO L290 TraceCheckUtils]: 126: Hoare triple {139269#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139269#(< main_~i~0 1014)} is VALID [2022-04-28 03:07:17,440 INFO L290 TraceCheckUtils]: 125: Hoare triple {139276#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139269#(< main_~i~0 1014)} is VALID [2022-04-28 03:07:17,441 INFO L290 TraceCheckUtils]: 124: Hoare triple {139276#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139276#(< main_~i~0 1013)} is VALID [2022-04-28 03:07:17,441 INFO L290 TraceCheckUtils]: 123: Hoare triple {139283#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139276#(< main_~i~0 1013)} is VALID [2022-04-28 03:07:17,441 INFO L290 TraceCheckUtils]: 122: Hoare triple {139283#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139283#(< main_~i~0 1012)} is VALID [2022-04-28 03:07:17,441 INFO L290 TraceCheckUtils]: 121: Hoare triple {139290#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139283#(< main_~i~0 1012)} is VALID [2022-04-28 03:07:17,442 INFO L290 TraceCheckUtils]: 120: Hoare triple {139290#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139290#(< main_~i~0 1011)} is VALID [2022-04-28 03:07:17,442 INFO L290 TraceCheckUtils]: 119: Hoare triple {139297#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139290#(< main_~i~0 1011)} is VALID [2022-04-28 03:07:17,442 INFO L290 TraceCheckUtils]: 118: Hoare triple {139297#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139297#(< main_~i~0 1010)} is VALID [2022-04-28 03:07:17,442 INFO L290 TraceCheckUtils]: 117: Hoare triple {139304#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139297#(< main_~i~0 1010)} is VALID [2022-04-28 03:07:17,442 INFO L290 TraceCheckUtils]: 116: Hoare triple {139304#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139304#(< main_~i~0 1009)} is VALID [2022-04-28 03:07:17,443 INFO L290 TraceCheckUtils]: 115: Hoare triple {139311#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139304#(< main_~i~0 1009)} is VALID [2022-04-28 03:07:17,443 INFO L290 TraceCheckUtils]: 114: Hoare triple {139311#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139311#(< main_~i~0 1008)} is VALID [2022-04-28 03:07:17,443 INFO L290 TraceCheckUtils]: 113: Hoare triple {139318#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139311#(< main_~i~0 1008)} is VALID [2022-04-28 03:07:17,443 INFO L290 TraceCheckUtils]: 112: Hoare triple {139318#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139318#(< main_~i~0 1007)} is VALID [2022-04-28 03:07:17,444 INFO L290 TraceCheckUtils]: 111: Hoare triple {139325#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139318#(< main_~i~0 1007)} is VALID [2022-04-28 03:07:17,444 INFO L290 TraceCheckUtils]: 110: Hoare triple {139325#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139325#(< main_~i~0 1006)} is VALID [2022-04-28 03:07:17,444 INFO L290 TraceCheckUtils]: 109: Hoare triple {139332#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139325#(< main_~i~0 1006)} is VALID [2022-04-28 03:07:17,444 INFO L290 TraceCheckUtils]: 108: Hoare triple {139332#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139332#(< main_~i~0 1005)} is VALID [2022-04-28 03:07:17,445 INFO L290 TraceCheckUtils]: 107: Hoare triple {139339#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139332#(< main_~i~0 1005)} is VALID [2022-04-28 03:07:17,445 INFO L290 TraceCheckUtils]: 106: Hoare triple {139339#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139339#(< main_~i~0 1004)} is VALID [2022-04-28 03:07:17,445 INFO L290 TraceCheckUtils]: 105: Hoare triple {139346#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139339#(< main_~i~0 1004)} is VALID [2022-04-28 03:07:17,445 INFO L290 TraceCheckUtils]: 104: Hoare triple {139346#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139346#(< main_~i~0 1003)} is VALID [2022-04-28 03:07:17,445 INFO L290 TraceCheckUtils]: 103: Hoare triple {139353#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139346#(< main_~i~0 1003)} is VALID [2022-04-28 03:07:17,446 INFO L290 TraceCheckUtils]: 102: Hoare triple {139353#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139353#(< main_~i~0 1002)} is VALID [2022-04-28 03:07:17,446 INFO L290 TraceCheckUtils]: 101: Hoare triple {139360#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139353#(< main_~i~0 1002)} is VALID [2022-04-28 03:07:17,446 INFO L290 TraceCheckUtils]: 100: Hoare triple {139360#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139360#(< main_~i~0 1001)} is VALID [2022-04-28 03:07:17,446 INFO L290 TraceCheckUtils]: 99: Hoare triple {139367#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139360#(< main_~i~0 1001)} is VALID [2022-04-28 03:07:17,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {139367#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139367#(< main_~i~0 1000)} is VALID [2022-04-28 03:07:17,447 INFO L290 TraceCheckUtils]: 97: Hoare triple {139374#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139367#(< main_~i~0 1000)} is VALID [2022-04-28 03:07:17,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {139374#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139374#(< main_~i~0 999)} is VALID [2022-04-28 03:07:17,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {139381#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139374#(< main_~i~0 999)} is VALID [2022-04-28 03:07:17,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {139381#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139381#(< main_~i~0 998)} is VALID [2022-04-28 03:07:17,448 INFO L290 TraceCheckUtils]: 93: Hoare triple {139388#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139381#(< main_~i~0 998)} is VALID [2022-04-28 03:07:17,448 INFO L290 TraceCheckUtils]: 92: Hoare triple {139388#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139388#(< main_~i~0 997)} is VALID [2022-04-28 03:07:17,448 INFO L290 TraceCheckUtils]: 91: Hoare triple {139395#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139388#(< main_~i~0 997)} is VALID [2022-04-28 03:07:17,448 INFO L290 TraceCheckUtils]: 90: Hoare triple {139395#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139395#(< main_~i~0 996)} is VALID [2022-04-28 03:07:17,449 INFO L290 TraceCheckUtils]: 89: Hoare triple {139402#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139395#(< main_~i~0 996)} is VALID [2022-04-28 03:07:17,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {139402#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139402#(< main_~i~0 995)} is VALID [2022-04-28 03:07:17,449 INFO L290 TraceCheckUtils]: 87: Hoare triple {139409#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139402#(< main_~i~0 995)} is VALID [2022-04-28 03:07:17,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {139409#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139409#(< main_~i~0 994)} is VALID [2022-04-28 03:07:17,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {139416#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139409#(< main_~i~0 994)} is VALID [2022-04-28 03:07:17,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {139416#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139416#(< main_~i~0 993)} is VALID [2022-04-28 03:07:17,450 INFO L290 TraceCheckUtils]: 83: Hoare triple {139423#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139416#(< main_~i~0 993)} is VALID [2022-04-28 03:07:17,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {139423#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139423#(< main_~i~0 992)} is VALID [2022-04-28 03:07:17,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {139430#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139423#(< main_~i~0 992)} is VALID [2022-04-28 03:07:17,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {139430#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139430#(< main_~i~0 991)} is VALID [2022-04-28 03:07:17,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {139437#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139430#(< main_~i~0 991)} is VALID [2022-04-28 03:07:17,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {139437#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139437#(< main_~i~0 990)} is VALID [2022-04-28 03:07:17,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {139444#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139437#(< main_~i~0 990)} is VALID [2022-04-28 03:07:17,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {139444#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139444#(< main_~i~0 989)} is VALID [2022-04-28 03:07:17,452 INFO L290 TraceCheckUtils]: 75: Hoare triple {139451#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139444#(< main_~i~0 989)} is VALID [2022-04-28 03:07:17,452 INFO L290 TraceCheckUtils]: 74: Hoare triple {139451#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139451#(< main_~i~0 988)} is VALID [2022-04-28 03:07:17,452 INFO L290 TraceCheckUtils]: 73: Hoare triple {139458#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139451#(< main_~i~0 988)} is VALID [2022-04-28 03:07:17,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {139458#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139458#(< main_~i~0 987)} is VALID [2022-04-28 03:07:17,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {139465#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139458#(< main_~i~0 987)} is VALID [2022-04-28 03:07:17,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {139465#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139465#(< main_~i~0 986)} is VALID [2022-04-28 03:07:17,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {139472#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139465#(< main_~i~0 986)} is VALID [2022-04-28 03:07:17,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {139472#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139472#(< main_~i~0 985)} is VALID [2022-04-28 03:07:17,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {139479#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139472#(< main_~i~0 985)} is VALID [2022-04-28 03:07:17,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {139479#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139479#(< main_~i~0 984)} is VALID [2022-04-28 03:07:17,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {139486#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139479#(< main_~i~0 984)} is VALID [2022-04-28 03:07:17,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {139486#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139486#(< main_~i~0 983)} is VALID [2022-04-28 03:07:17,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {139493#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139486#(< main_~i~0 983)} is VALID [2022-04-28 03:07:17,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {139493#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139493#(< main_~i~0 982)} is VALID [2022-04-28 03:07:17,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {139500#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139493#(< main_~i~0 982)} is VALID [2022-04-28 03:07:17,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {139500#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139500#(< main_~i~0 981)} is VALID [2022-04-28 03:07:17,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {139507#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139500#(< main_~i~0 981)} is VALID [2022-04-28 03:07:17,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {139507#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139507#(< main_~i~0 980)} is VALID [2022-04-28 03:07:17,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {139514#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139507#(< main_~i~0 980)} is VALID [2022-04-28 03:07:17,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {139514#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139514#(< main_~i~0 979)} is VALID [2022-04-28 03:07:17,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {139521#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139514#(< main_~i~0 979)} is VALID [2022-04-28 03:07:17,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {139521#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139521#(< main_~i~0 978)} is VALID [2022-04-28 03:07:17,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {139528#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139521#(< main_~i~0 978)} is VALID [2022-04-28 03:07:17,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {139528#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139528#(< main_~i~0 977)} is VALID [2022-04-28 03:07:17,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {139535#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139528#(< main_~i~0 977)} is VALID [2022-04-28 03:07:17,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {139535#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139535#(< main_~i~0 976)} is VALID [2022-04-28 03:07:17,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {139542#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139535#(< main_~i~0 976)} is VALID [2022-04-28 03:07:17,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {139542#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139542#(< main_~i~0 975)} is VALID [2022-04-28 03:07:17,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {139549#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139542#(< main_~i~0 975)} is VALID [2022-04-28 03:07:17,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {139549#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139549#(< main_~i~0 974)} is VALID [2022-04-28 03:07:17,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {139556#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139549#(< main_~i~0 974)} is VALID [2022-04-28 03:07:17,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {139556#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139556#(< main_~i~0 973)} is VALID [2022-04-28 03:07:17,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {139563#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139556#(< main_~i~0 973)} is VALID [2022-04-28 03:07:17,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {139563#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139563#(< main_~i~0 972)} is VALID [2022-04-28 03:07:17,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {139570#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139563#(< main_~i~0 972)} is VALID [2022-04-28 03:07:17,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {139570#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139570#(< main_~i~0 971)} is VALID [2022-04-28 03:07:17,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {139577#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139570#(< main_~i~0 971)} is VALID [2022-04-28 03:07:17,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {139577#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139577#(< main_~i~0 970)} is VALID [2022-04-28 03:07:17,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {139584#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139577#(< main_~i~0 970)} is VALID [2022-04-28 03:07:17,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {139584#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139584#(< main_~i~0 969)} is VALID [2022-04-28 03:07:17,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {139591#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139584#(< main_~i~0 969)} is VALID [2022-04-28 03:07:17,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {139591#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139591#(< main_~i~0 968)} is VALID [2022-04-28 03:07:17,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {139598#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139591#(< main_~i~0 968)} is VALID [2022-04-28 03:07:17,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {139598#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139598#(< main_~i~0 967)} is VALID [2022-04-28 03:07:17,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {139605#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139598#(< main_~i~0 967)} is VALID [2022-04-28 03:07:17,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {139605#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139605#(< main_~i~0 966)} is VALID [2022-04-28 03:07:17,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {139612#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139605#(< main_~i~0 966)} is VALID [2022-04-28 03:07:17,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {139612#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139612#(< main_~i~0 965)} is VALID [2022-04-28 03:07:17,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {139619#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139612#(< main_~i~0 965)} is VALID [2022-04-28 03:07:17,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {139619#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139619#(< main_~i~0 964)} is VALID [2022-04-28 03:07:17,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {139626#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139619#(< main_~i~0 964)} is VALID [2022-04-28 03:07:17,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {139626#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139626#(< main_~i~0 963)} is VALID [2022-04-28 03:07:17,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {139633#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139626#(< main_~i~0 963)} is VALID [2022-04-28 03:07:17,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {139633#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139633#(< main_~i~0 962)} is VALID [2022-04-28 03:07:17,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {139640#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139633#(< main_~i~0 962)} is VALID [2022-04-28 03:07:17,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {139640#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139640#(< main_~i~0 961)} is VALID [2022-04-28 03:07:17,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {139647#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139640#(< main_~i~0 961)} is VALID [2022-04-28 03:07:17,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {139647#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139647#(< main_~i~0 960)} is VALID [2022-04-28 03:07:17,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {139654#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139647#(< main_~i~0 960)} is VALID [2022-04-28 03:07:17,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {139654#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139654#(< main_~i~0 959)} is VALID [2022-04-28 03:07:17,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {139661#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139654#(< main_~i~0 959)} is VALID [2022-04-28 03:07:17,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {139661#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139661#(< main_~i~0 958)} is VALID [2022-04-28 03:07:17,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {139668#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139661#(< main_~i~0 958)} is VALID [2022-04-28 03:07:17,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {139668#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139668#(< main_~i~0 957)} is VALID [2022-04-28 03:07:17,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {139675#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139668#(< main_~i~0 957)} is VALID [2022-04-28 03:07:17,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {139675#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139675#(< main_~i~0 956)} is VALID [2022-04-28 03:07:17,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {139682#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139675#(< main_~i~0 956)} is VALID [2022-04-28 03:07:17,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {139682#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139682#(< main_~i~0 955)} is VALID [2022-04-28 03:07:17,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {139689#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {139682#(< main_~i~0 955)} is VALID [2022-04-28 03:07:17,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {139689#(< main_~i~0 954)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {139689#(< main_~i~0 954)} is VALID [2022-04-28 03:07:17,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {138587#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {139689#(< main_~i~0 954)} is VALID [2022-04-28 03:07:17,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {138587#true} call #t~ret6 := main(); {138587#true} is VALID [2022-04-28 03:07:17,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138587#true} {138587#true} #64#return; {138587#true} is VALID [2022-04-28 03:07:17,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {138587#true} assume true; {138587#true} is VALID [2022-04-28 03:07:17,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {138587#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(12, 2); {138587#true} is VALID [2022-04-28 03:07:17,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {138587#true} call ULTIMATE.init(); {138587#true} is VALID [2022-04-28 03:07:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:07:17,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144973611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:17,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:17,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73, 73] total 146 [2022-04-28 03:07:17,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:17,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626144644] [2022-04-28 03:07:17,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626144644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:17,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:17,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-28 03:07:17,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710939062] [2022-04-28 03:07:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 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 163 [2022-04-28 03:07:17,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:17,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:17,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-28 03:07:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-28 03:07:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10442, Invalid=10728, Unknown=0, NotChecked=0, Total=21170 [2022-04-28 03:07:17,532 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:37,181 INFO L93 Difference]: Finished difference Result 530 states and 676 transitions. [2022-04-28 03:07:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-28 03:07:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 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 163 [2022-04-28 03:07:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 667 transitions. [2022-04-28 03:07:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 667 transitions. [2022-04-28 03:07:37,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 667 transitions. [2022-04-28 03:07:37,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:37,492 INFO L225 Difference]: With dead ends: 530 [2022-04-28 03:07:37,492 INFO L226 Difference]: Without dead ends: 513 [2022-04-28 03:07:37,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=20738, Invalid=26134, Unknown=0, NotChecked=0, Total=46872 [2022-04-28 03:07:37,494 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1765 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:37,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 42 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:07:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-04-28 03:07:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 166. [2022-04-28 03:07:38,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:38,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:38,346 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:38,346 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:38,354 INFO L93 Difference]: Finished difference Result 513 states and 655 transitions. [2022-04-28 03:07:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 655 transitions. [2022-04-28 03:07:38,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:38,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:38,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 513 states. [2022-04-28 03:07:38,355 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 513 states. [2022-04-28 03:07:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:38,363 INFO L93 Difference]: Finished difference Result 513 states and 655 transitions. [2022-04-28 03:07:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 655 transitions. [2022-04-28 03:07:38,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:38,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:38,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:38,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.031055900621118) internal successors, (166), 161 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2022-04-28 03:07:38,365 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 163 [2022-04-28 03:07:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:38,365 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2022-04-28 03:07:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.0675675675675675) internal successors, (153), 73 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:38,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 170 transitions. [2022-04-28 03:07:38,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2022-04-28 03:07:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-28 03:07:38,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:38,833 INFO L195 NwaCegarLoop]: trace histogram [71, 71, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:38,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-28 03:07:39,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-04-28 03:07:39,051 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1366479345, now seen corresponding path program 143 times [2022-04-28 03:07:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:39,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015198959] [2022-04-28 03:07:39,055 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:39,055 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:07:39,055 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1366479345, now seen corresponding path program 144 times [2022-04-28 03:07:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:39,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992905688] [2022-04-28 03:07:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:40,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {142350#(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(12, 2); {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {142273#true} assume true; {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142273#true} {142273#true} #64#return; {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {142273#true} call ULTIMATE.init(); {142350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {142350#(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(12, 2); {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {142273#true} assume true; {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142273#true} {142273#true} #64#return; {142273#true} is VALID [2022-04-28 03:07:40,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {142273#true} call #t~ret6 := main(); {142273#true} is VALID [2022-04-28 03:07:40,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {142273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {142278#(= main_~i~0 0)} is VALID [2022-04-28 03:07:40,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {142278#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142278#(= main_~i~0 0)} is VALID [2022-04-28 03:07:40,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {142278#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:40,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {142279#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:40,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {142279#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:40,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {142280#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:40,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {142280#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142281#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:40,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {142281#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142281#(<= main_~i~0 3)} is VALID [2022-04-28 03:07:40,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {142281#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142282#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:40,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {142282#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142282#(<= main_~i~0 4)} is VALID [2022-04-28 03:07:40,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {142282#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142283#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:40,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {142283#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142283#(<= main_~i~0 5)} is VALID [2022-04-28 03:07:40,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {142283#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142284#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:40,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {142284#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142284#(<= main_~i~0 6)} is VALID [2022-04-28 03:07:40,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {142284#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142285#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:40,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {142285#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142285#(<= main_~i~0 7)} is VALID [2022-04-28 03:07:40,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {142285#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142286#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:40,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {142286#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142286#(<= main_~i~0 8)} is VALID [2022-04-28 03:07:40,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {142286#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142287#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:40,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {142287#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142287#(<= main_~i~0 9)} is VALID [2022-04-28 03:07:40,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {142287#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142288#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:40,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {142288#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142288#(<= main_~i~0 10)} is VALID [2022-04-28 03:07:40,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {142288#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142289#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:40,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {142289#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142289#(<= main_~i~0 11)} is VALID [2022-04-28 03:07:40,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {142289#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142290#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:40,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {142290#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142290#(<= main_~i~0 12)} is VALID [2022-04-28 03:07:40,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {142290#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142291#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:40,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {142291#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142291#(<= main_~i~0 13)} is VALID [2022-04-28 03:07:40,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {142291#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142292#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:40,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {142292#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142292#(<= main_~i~0 14)} is VALID [2022-04-28 03:07:40,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {142292#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142293#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:40,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {142293#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142293#(<= main_~i~0 15)} is VALID [2022-04-28 03:07:40,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {142293#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142294#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:40,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {142294#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142294#(<= main_~i~0 16)} is VALID [2022-04-28 03:07:40,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {142294#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142295#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:40,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {142295#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142295#(<= main_~i~0 17)} is VALID [2022-04-28 03:07:40,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {142295#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142296#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:40,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {142296#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142296#(<= main_~i~0 18)} is VALID [2022-04-28 03:07:40,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {142296#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142297#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:40,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {142297#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142297#(<= main_~i~0 19)} is VALID [2022-04-28 03:07:40,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {142297#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142298#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:40,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {142298#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142298#(<= main_~i~0 20)} is VALID [2022-04-28 03:07:40,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {142298#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142299#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:40,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {142299#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142299#(<= main_~i~0 21)} is VALID [2022-04-28 03:07:40,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {142299#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142300#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:40,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {142300#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142300#(<= main_~i~0 22)} is VALID [2022-04-28 03:07:40,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {142300#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142301#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:40,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {142301#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142301#(<= main_~i~0 23)} is VALID [2022-04-28 03:07:40,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {142301#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142302#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:40,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {142302#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142302#(<= main_~i~0 24)} is VALID [2022-04-28 03:07:40,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {142302#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142303#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:40,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {142303#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142303#(<= main_~i~0 25)} is VALID [2022-04-28 03:07:40,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {142303#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142304#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:40,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {142304#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142304#(<= main_~i~0 26)} is VALID [2022-04-28 03:07:40,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {142304#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142305#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:40,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {142305#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142305#(<= main_~i~0 27)} is VALID [2022-04-28 03:07:40,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {142305#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142306#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:40,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {142306#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142306#(<= main_~i~0 28)} is VALID [2022-04-28 03:07:40,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {142306#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142307#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:40,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {142307#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142307#(<= main_~i~0 29)} is VALID [2022-04-28 03:07:40,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {142307#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142308#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:40,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {142308#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142308#(<= main_~i~0 30)} is VALID [2022-04-28 03:07:40,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {142308#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142309#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:40,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {142309#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142309#(<= main_~i~0 31)} is VALID [2022-04-28 03:07:40,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {142309#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142310#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:40,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {142310#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142310#(<= main_~i~0 32)} is VALID [2022-04-28 03:07:40,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {142310#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142311#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:40,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {142311#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142311#(<= main_~i~0 33)} is VALID [2022-04-28 03:07:40,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {142311#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142312#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:40,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {142312#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142312#(<= main_~i~0 34)} is VALID [2022-04-28 03:07:40,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {142312#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142313#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:40,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {142313#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142313#(<= main_~i~0 35)} is VALID [2022-04-28 03:07:40,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {142313#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142314#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:40,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {142314#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142314#(<= main_~i~0 36)} is VALID [2022-04-28 03:07:40,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {142314#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142315#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:40,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {142315#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142315#(<= main_~i~0 37)} is VALID [2022-04-28 03:07:40,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {142315#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142316#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:40,410 INFO L290 TraceCheckUtils]: 82: Hoare triple {142316#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142316#(<= main_~i~0 38)} is VALID [2022-04-28 03:07:40,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {142316#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142317#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:40,411 INFO L290 TraceCheckUtils]: 84: Hoare triple {142317#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142317#(<= main_~i~0 39)} is VALID [2022-04-28 03:07:40,411 INFO L290 TraceCheckUtils]: 85: Hoare triple {142317#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142318#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:40,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {142318#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142318#(<= main_~i~0 40)} is VALID [2022-04-28 03:07:40,412 INFO L290 TraceCheckUtils]: 87: Hoare triple {142318#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142319#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:40,412 INFO L290 TraceCheckUtils]: 88: Hoare triple {142319#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142319#(<= main_~i~0 41)} is VALID [2022-04-28 03:07:40,412 INFO L290 TraceCheckUtils]: 89: Hoare triple {142319#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142320#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:40,412 INFO L290 TraceCheckUtils]: 90: Hoare triple {142320#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142320#(<= main_~i~0 42)} is VALID [2022-04-28 03:07:40,412 INFO L290 TraceCheckUtils]: 91: Hoare triple {142320#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142321#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:40,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {142321#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142321#(<= main_~i~0 43)} is VALID [2022-04-28 03:07:40,413 INFO L290 TraceCheckUtils]: 93: Hoare triple {142321#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142322#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:40,413 INFO L290 TraceCheckUtils]: 94: Hoare triple {142322#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142322#(<= main_~i~0 44)} is VALID [2022-04-28 03:07:40,413 INFO L290 TraceCheckUtils]: 95: Hoare triple {142322#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142323#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:40,414 INFO L290 TraceCheckUtils]: 96: Hoare triple {142323#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142323#(<= main_~i~0 45)} is VALID [2022-04-28 03:07:40,414 INFO L290 TraceCheckUtils]: 97: Hoare triple {142323#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142324#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:40,414 INFO L290 TraceCheckUtils]: 98: Hoare triple {142324#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142324#(<= main_~i~0 46)} is VALID [2022-04-28 03:07:40,414 INFO L290 TraceCheckUtils]: 99: Hoare triple {142324#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142325#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:40,414 INFO L290 TraceCheckUtils]: 100: Hoare triple {142325#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142325#(<= main_~i~0 47)} is VALID [2022-04-28 03:07:40,415 INFO L290 TraceCheckUtils]: 101: Hoare triple {142325#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142326#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:40,415 INFO L290 TraceCheckUtils]: 102: Hoare triple {142326#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142326#(<= main_~i~0 48)} is VALID [2022-04-28 03:07:40,415 INFO L290 TraceCheckUtils]: 103: Hoare triple {142326#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142327#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:40,415 INFO L290 TraceCheckUtils]: 104: Hoare triple {142327#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142327#(<= main_~i~0 49)} is VALID [2022-04-28 03:07:40,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {142327#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142328#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:40,416 INFO L290 TraceCheckUtils]: 106: Hoare triple {142328#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142328#(<= main_~i~0 50)} is VALID [2022-04-28 03:07:40,416 INFO L290 TraceCheckUtils]: 107: Hoare triple {142328#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142329#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:40,416 INFO L290 TraceCheckUtils]: 108: Hoare triple {142329#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142329#(<= main_~i~0 51)} is VALID [2022-04-28 03:07:40,416 INFO L290 TraceCheckUtils]: 109: Hoare triple {142329#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142330#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:40,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {142330#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142330#(<= main_~i~0 52)} is VALID [2022-04-28 03:07:40,417 INFO L290 TraceCheckUtils]: 111: Hoare triple {142330#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142331#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:40,417 INFO L290 TraceCheckUtils]: 112: Hoare triple {142331#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142331#(<= main_~i~0 53)} is VALID [2022-04-28 03:07:40,417 INFO L290 TraceCheckUtils]: 113: Hoare triple {142331#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142332#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:40,418 INFO L290 TraceCheckUtils]: 114: Hoare triple {142332#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142332#(<= main_~i~0 54)} is VALID [2022-04-28 03:07:40,418 INFO L290 TraceCheckUtils]: 115: Hoare triple {142332#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142333#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:40,418 INFO L290 TraceCheckUtils]: 116: Hoare triple {142333#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142333#(<= main_~i~0 55)} is VALID [2022-04-28 03:07:40,418 INFO L290 TraceCheckUtils]: 117: Hoare triple {142333#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142334#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:40,418 INFO L290 TraceCheckUtils]: 118: Hoare triple {142334#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142334#(<= main_~i~0 56)} is VALID [2022-04-28 03:07:40,419 INFO L290 TraceCheckUtils]: 119: Hoare triple {142334#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142335#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:40,419 INFO L290 TraceCheckUtils]: 120: Hoare triple {142335#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142335#(<= main_~i~0 57)} is VALID [2022-04-28 03:07:40,419 INFO L290 TraceCheckUtils]: 121: Hoare triple {142335#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142336#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:40,419 INFO L290 TraceCheckUtils]: 122: Hoare triple {142336#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142336#(<= main_~i~0 58)} is VALID [2022-04-28 03:07:40,420 INFO L290 TraceCheckUtils]: 123: Hoare triple {142336#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142337#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:40,420 INFO L290 TraceCheckUtils]: 124: Hoare triple {142337#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142337#(<= main_~i~0 59)} is VALID [2022-04-28 03:07:40,420 INFO L290 TraceCheckUtils]: 125: Hoare triple {142337#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142338#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:40,420 INFO L290 TraceCheckUtils]: 126: Hoare triple {142338#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142338#(<= main_~i~0 60)} is VALID [2022-04-28 03:07:40,420 INFO L290 TraceCheckUtils]: 127: Hoare triple {142338#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142339#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:40,421 INFO L290 TraceCheckUtils]: 128: Hoare triple {142339#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142339#(<= main_~i~0 61)} is VALID [2022-04-28 03:07:40,421 INFO L290 TraceCheckUtils]: 129: Hoare triple {142339#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142340#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:40,421 INFO L290 TraceCheckUtils]: 130: Hoare triple {142340#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142340#(<= main_~i~0 62)} is VALID [2022-04-28 03:07:40,421 INFO L290 TraceCheckUtils]: 131: Hoare triple {142340#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142341#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:40,422 INFO L290 TraceCheckUtils]: 132: Hoare triple {142341#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142341#(<= main_~i~0 63)} is VALID [2022-04-28 03:07:40,422 INFO L290 TraceCheckUtils]: 133: Hoare triple {142341#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142342#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:40,422 INFO L290 TraceCheckUtils]: 134: Hoare triple {142342#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142342#(<= main_~i~0 64)} is VALID [2022-04-28 03:07:40,422 INFO L290 TraceCheckUtils]: 135: Hoare triple {142342#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142343#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:40,422 INFO L290 TraceCheckUtils]: 136: Hoare triple {142343#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142343#(<= main_~i~0 65)} is VALID [2022-04-28 03:07:40,423 INFO L290 TraceCheckUtils]: 137: Hoare triple {142343#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142344#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:40,423 INFO L290 TraceCheckUtils]: 138: Hoare triple {142344#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142344#(<= main_~i~0 66)} is VALID [2022-04-28 03:07:40,423 INFO L290 TraceCheckUtils]: 139: Hoare triple {142344#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142345#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:40,423 INFO L290 TraceCheckUtils]: 140: Hoare triple {142345#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142345#(<= main_~i~0 67)} is VALID [2022-04-28 03:07:40,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {142345#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142346#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:40,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {142346#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142346#(<= main_~i~0 68)} is VALID [2022-04-28 03:07:40,424 INFO L290 TraceCheckUtils]: 143: Hoare triple {142346#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142347#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:40,424 INFO L290 TraceCheckUtils]: 144: Hoare triple {142347#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142347#(<= main_~i~0 69)} is VALID [2022-04-28 03:07:40,424 INFO L290 TraceCheckUtils]: 145: Hoare triple {142347#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142348#(<= main_~i~0 70)} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 146: Hoare triple {142348#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142348#(<= main_~i~0 70)} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 147: Hoare triple {142348#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142349#(<= main_~i~0 71)} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 148: Hoare triple {142349#(<= main_~i~0 71)} assume !(~i~0 < 1024); {142274#false} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 149: Hoare triple {142274#false} ~i~0 := 0; {142274#false} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 150: Hoare triple {142274#false} #t~short5 := ~i~0 < 1024; {142274#false} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 151: Hoare triple {142274#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142274#false} is VALID [2022-04-28 03:07:40,425 INFO L290 TraceCheckUtils]: 152: Hoare triple {142274#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 153: Hoare triple {142274#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 154: Hoare triple {142274#false} #t~short5 := ~i~0 < 1024; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 155: Hoare triple {142274#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 156: Hoare triple {142274#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 157: Hoare triple {142274#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 158: Hoare triple {142274#false} #t~short5 := ~i~0 < 1024; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 159: Hoare triple {142274#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 160: Hoare triple {142274#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L272 TraceCheckUtils]: 161: Hoare triple {142274#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 162: Hoare triple {142274#false} ~cond := #in~cond; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 163: Hoare triple {142274#false} assume 0 == ~cond; {142274#false} is VALID [2022-04-28 03:07:40,426 INFO L290 TraceCheckUtils]: 164: Hoare triple {142274#false} assume !false; {142274#false} is VALID [2022-04-28 03:07:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5051 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:07:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:40,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992905688] [2022-04-28 03:07:40,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992905688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:40,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651587104] [2022-04-28 03:07:40,427 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:40,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:40,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:40,428 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:07:40,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-28 03:07:40,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:07:40,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:40,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:07:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:40,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:41,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {142273#true} call ULTIMATE.init(); {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {142273#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(12, 2); {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {142273#true} assume true; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142273#true} {142273#true} #64#return; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {142273#true} call #t~ret6 := main(); {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {142273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 63: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 82: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 83: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 84: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 85: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 86: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 88: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 89: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 91: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 92: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 93: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 98: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 99: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 100: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 101: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 102: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,158 INFO L290 TraceCheckUtils]: 103: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 106: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 107: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 108: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 109: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 110: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 111: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 112: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 113: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 114: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 115: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 116: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 117: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,159 INFO L290 TraceCheckUtils]: 118: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 119: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 120: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 121: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 122: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 123: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 124: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 125: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 126: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 127: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 128: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 129: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 130: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 131: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 132: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,160 INFO L290 TraceCheckUtils]: 134: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 135: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 136: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 137: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 138: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 139: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 140: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 141: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 142: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 143: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 144: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 145: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 146: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 147: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,161 INFO L290 TraceCheckUtils]: 148: Hoare triple {142273#true} assume !(~i~0 < 1024); {142273#true} is VALID [2022-04-28 03:07:41,162 INFO L290 TraceCheckUtils]: 149: Hoare triple {142273#true} ~i~0 := 0; {142801#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:41,162 INFO L290 TraceCheckUtils]: 150: Hoare triple {142801#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {142801#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:41,162 INFO L290 TraceCheckUtils]: 151: Hoare triple {142801#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142801#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:41,162 INFO L290 TraceCheckUtils]: 152: Hoare triple {142801#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142801#(<= main_~i~0 0)} is VALID [2022-04-28 03:07:41,163 INFO L290 TraceCheckUtils]: 153: Hoare triple {142801#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:41,163 INFO L290 TraceCheckUtils]: 154: Hoare triple {142279#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:41,163 INFO L290 TraceCheckUtils]: 155: Hoare triple {142279#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:41,163 INFO L290 TraceCheckUtils]: 156: Hoare triple {142279#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142279#(<= main_~i~0 1)} is VALID [2022-04-28 03:07:41,164 INFO L290 TraceCheckUtils]: 157: Hoare triple {142279#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:41,164 INFO L290 TraceCheckUtils]: 158: Hoare triple {142280#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:41,164 INFO L290 TraceCheckUtils]: 159: Hoare triple {142280#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:41,164 INFO L290 TraceCheckUtils]: 160: Hoare triple {142280#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {142280#(<= main_~i~0 2)} is VALID [2022-04-28 03:07:41,165 INFO L272 TraceCheckUtils]: 161: Hoare triple {142280#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {142838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:07:41,165 INFO L290 TraceCheckUtils]: 162: Hoare triple {142838#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {142842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:07:41,165 INFO L290 TraceCheckUtils]: 163: Hoare triple {142842#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {142274#false} is VALID [2022-04-28 03:07:41,165 INFO L290 TraceCheckUtils]: 164: Hoare triple {142274#false} assume !false; {142274#false} is VALID [2022-04-28 03:07:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5051 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2022-04-28 03:07:41,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:41,489 INFO L290 TraceCheckUtils]: 164: Hoare triple {142274#false} assume !false; {142274#false} is VALID [2022-04-28 03:07:41,489 INFO L290 TraceCheckUtils]: 163: Hoare triple {142842#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {142274#false} is VALID [2022-04-28 03:07:41,489 INFO L290 TraceCheckUtils]: 162: Hoare triple {142838#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {142842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:07:41,490 INFO L272 TraceCheckUtils]: 161: Hoare triple {142858#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {142838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:07:41,490 INFO L290 TraceCheckUtils]: 160: Hoare triple {142858#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {142858#(<= main_~i~0 512)} is VALID [2022-04-28 03:07:41,490 INFO L290 TraceCheckUtils]: 159: Hoare triple {142858#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142858#(<= main_~i~0 512)} is VALID [2022-04-28 03:07:41,490 INFO L290 TraceCheckUtils]: 158: Hoare triple {142858#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {142858#(<= main_~i~0 512)} is VALID [2022-04-28 03:07:41,490 INFO L290 TraceCheckUtils]: 157: Hoare triple {142871#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142858#(<= main_~i~0 512)} is VALID [2022-04-28 03:07:41,491 INFO L290 TraceCheckUtils]: 156: Hoare triple {142871#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142871#(<= main_~i~0 511)} is VALID [2022-04-28 03:07:41,491 INFO L290 TraceCheckUtils]: 155: Hoare triple {142871#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142871#(<= main_~i~0 511)} is VALID [2022-04-28 03:07:41,491 INFO L290 TraceCheckUtils]: 154: Hoare triple {142871#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {142871#(<= main_~i~0 511)} is VALID [2022-04-28 03:07:41,491 INFO L290 TraceCheckUtils]: 153: Hoare triple {142884#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {142871#(<= main_~i~0 511)} is VALID [2022-04-28 03:07:41,491 INFO L290 TraceCheckUtils]: 152: Hoare triple {142884#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {142884#(<= main_~i~0 510)} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 151: Hoare triple {142884#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {142884#(<= main_~i~0 510)} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 150: Hoare triple {142884#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {142884#(<= main_~i~0 510)} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 149: Hoare triple {142273#true} ~i~0 := 0; {142884#(<= main_~i~0 510)} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 148: Hoare triple {142273#true} assume !(~i~0 < 1024); {142273#true} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 147: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 146: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 145: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 144: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,492 INFO L290 TraceCheckUtils]: 143: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 142: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 141: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 140: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 139: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 138: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 137: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 136: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 135: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 134: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 133: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 132: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 131: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 130: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 129: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 127: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 125: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 124: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 123: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 122: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 121: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 120: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 119: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 118: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 117: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 116: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 115: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 114: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,494 INFO L290 TraceCheckUtils]: 113: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 111: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 110: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 108: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 107: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 106: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 105: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 104: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 103: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 102: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 101: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 100: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 99: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,495 INFO L290 TraceCheckUtils]: 98: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 97: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 96: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 95: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 91: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 90: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 89: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 88: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 87: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 86: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 85: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 84: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 75: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 73: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {142273#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {142273#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {142273#true} is VALID [2022-04-28 03:07:41,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {142273#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {142273#true} call #t~ret6 := main(); {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142273#true} {142273#true} #64#return; {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {142273#true} assume true; {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {142273#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(12, 2); {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {142273#true} call ULTIMATE.init(); {142273#true} is VALID [2022-04-28 03:07:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5051 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2022-04-28 03:07:41,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651587104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:41,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:41,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 7, 7] total 81 [2022-04-28 03:07:41,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:41,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015198959] [2022-04-28 03:07:41,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015198959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:41,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:41,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-28 03:07:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060508510] [2022-04-28 03:07:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 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 165 [2022-04-28 03:07:41,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:41,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:41,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-28 03:07:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-28 03:07:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3009, Invalid=3471, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:07:41,571 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:02,350 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2022-04-28 03:08:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-28 03:08:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 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 165 [2022-04-28 03:08:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 676 transitions. [2022-04-28 03:08:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 676 transitions. [2022-04-28 03:08:02,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 676 transitions. [2022-04-28 03:08:02,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 676 edges. 676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:02,750 INFO L225 Difference]: With dead ends: 537 [2022-04-28 03:08:02,750 INFO L226 Difference]: Without dead ends: 520 [2022-04-28 03:08:02,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8626, Invalid=14630, Unknown=0, NotChecked=0, Total=23256 [2022-04-28 03:08:02,752 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1939 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:02,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 42 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:08:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-04-28 03:08:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 168. [2022-04-28 03:08:03,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:03,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 520 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:03,601 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:03,601 INFO L87 Difference]: Start difference. First operand 520 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:03,609 INFO L93 Difference]: Finished difference Result 520 states and 664 transitions. [2022-04-28 03:08:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 664 transitions. [2022-04-28 03:08:03,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:03,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:03,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 520 states. [2022-04-28 03:08:03,610 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 520 states. [2022-04-28 03:08:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:03,617 INFO L93 Difference]: Finished difference Result 520 states and 664 transitions. [2022-04-28 03:08:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 664 transitions. [2022-04-28 03:08:03,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:03,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:03,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:03,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2022-04-28 03:08:03,619 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 165 [2022-04-28 03:08:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:03,620 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2022-04-28 03:08:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.066666666666667) internal successors, (155), 74 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:03,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 172 transitions. [2022-04-28 03:08:04,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-28 03:08:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 03:08:04,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:04,151 INFO L195 NwaCegarLoop]: trace histogram [72, 72, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:04,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:04,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:04,366 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash 458390957, now seen corresponding path program 145 times [2022-04-28 03:08:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:04,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1949071962] [2022-04-28 03:08:04,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:04,369 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:04,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 458390957, now seen corresponding path program 146 times [2022-04-28 03:08:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:04,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412032359] [2022-04-28 03:08:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:05,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {146018#(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(12, 2); {145940#true} is VALID [2022-04-28 03:08:05,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {145940#true} assume true; {145940#true} is VALID [2022-04-28 03:08:05,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145940#true} {145940#true} #64#return; {145940#true} is VALID [2022-04-28 03:08:05,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {145940#true} call ULTIMATE.init(); {146018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:05,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {146018#(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(12, 2); {145940#true} is VALID [2022-04-28 03:08:05,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {145940#true} assume true; {145940#true} is VALID [2022-04-28 03:08:05,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145940#true} {145940#true} #64#return; {145940#true} is VALID [2022-04-28 03:08:05,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {145940#true} call #t~ret6 := main(); {145940#true} is VALID [2022-04-28 03:08:05,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {145940#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {145945#(= main_~i~0 0)} is VALID [2022-04-28 03:08:05,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {145945#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145945#(= main_~i~0 0)} is VALID [2022-04-28 03:08:05,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {145945#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145946#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:05,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {145946#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145946#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:05,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {145946#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145947#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:05,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {145947#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145947#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:05,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {145947#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145948#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:05,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {145948#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145948#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:05,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {145948#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145949#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:05,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {145949#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145949#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:05,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {145949#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145950#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:05,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {145950#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145950#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:05,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {145950#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145951#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:05,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {145951#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145951#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:05,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {145951#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145952#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:05,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {145952#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145952#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:05,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {145952#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145953#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:05,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {145953#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145953#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:05,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {145953#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145954#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:05,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {145954#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145954#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:05,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {145954#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145955#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:05,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {145955#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145955#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:05,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {145955#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145956#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:05,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {145956#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145956#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:05,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {145956#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145957#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:05,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {145957#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145957#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:05,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {145957#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145958#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:05,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {145958#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145958#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:05,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {145958#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145959#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:05,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {145959#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145959#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:05,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {145959#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145960#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:05,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {145960#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145960#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:05,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {145960#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145961#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:05,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {145961#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145961#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:05,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {145961#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145962#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:05,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {145962#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145962#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:05,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {145962#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145963#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:05,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {145963#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145963#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:05,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {145963#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145964#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:05,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {145964#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145964#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:05,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {145964#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145965#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:05,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {145965#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145965#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:05,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {145965#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145966#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:05,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {145966#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145966#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:05,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {145966#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145967#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:05,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {145967#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145967#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:05,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {145967#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145968#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:05,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {145968#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145968#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:05,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {145968#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145969#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:05,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {145969#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145969#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:05,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {145969#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145970#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:05,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {145970#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145970#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:05,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {145970#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145971#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:05,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {145971#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145971#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:05,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {145971#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145972#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:05,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {145972#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145972#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:05,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {145972#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145973#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:05,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {145973#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145973#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:05,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {145973#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145974#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:05,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {145974#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145974#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:05,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {145974#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145975#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:05,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {145975#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145975#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:05,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {145975#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145976#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:05,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {145976#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145976#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:05,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {145976#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145977#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:05,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {145977#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145977#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:05,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {145977#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145978#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:05,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {145978#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145978#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:05,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {145978#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145979#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:05,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {145979#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145979#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:05,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {145979#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145980#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:05,784 INFO L290 TraceCheckUtils]: 76: Hoare triple {145980#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145980#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:05,784 INFO L290 TraceCheckUtils]: 77: Hoare triple {145980#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145981#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:05,784 INFO L290 TraceCheckUtils]: 78: Hoare triple {145981#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145981#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:05,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {145981#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145982#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:05,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {145982#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145982#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:05,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {145982#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145983#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:05,785 INFO L290 TraceCheckUtils]: 82: Hoare triple {145983#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145983#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:05,786 INFO L290 TraceCheckUtils]: 83: Hoare triple {145983#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145984#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:05,786 INFO L290 TraceCheckUtils]: 84: Hoare triple {145984#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145984#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:05,786 INFO L290 TraceCheckUtils]: 85: Hoare triple {145984#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145985#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:05,786 INFO L290 TraceCheckUtils]: 86: Hoare triple {145985#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145985#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:05,787 INFO L290 TraceCheckUtils]: 87: Hoare triple {145985#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145986#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:05,787 INFO L290 TraceCheckUtils]: 88: Hoare triple {145986#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145986#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:05,787 INFO L290 TraceCheckUtils]: 89: Hoare triple {145986#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145987#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:05,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {145987#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145987#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:05,788 INFO L290 TraceCheckUtils]: 91: Hoare triple {145987#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145988#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:05,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {145988#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145988#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:05,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {145988#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145989#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:05,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {145989#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145989#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:05,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {145989#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145990#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:05,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {145990#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145990#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:05,790 INFO L290 TraceCheckUtils]: 97: Hoare triple {145990#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145991#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:05,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {145991#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145991#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:05,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {145991#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145992#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:05,791 INFO L290 TraceCheckUtils]: 100: Hoare triple {145992#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145992#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:05,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {145992#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145993#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:05,791 INFO L290 TraceCheckUtils]: 102: Hoare triple {145993#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145993#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:05,791 INFO L290 TraceCheckUtils]: 103: Hoare triple {145993#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145994#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:05,792 INFO L290 TraceCheckUtils]: 104: Hoare triple {145994#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145994#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:05,792 INFO L290 TraceCheckUtils]: 105: Hoare triple {145994#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145995#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:05,792 INFO L290 TraceCheckUtils]: 106: Hoare triple {145995#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145995#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:05,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {145995#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145996#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:05,793 INFO L290 TraceCheckUtils]: 108: Hoare triple {145996#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145996#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:05,793 INFO L290 TraceCheckUtils]: 109: Hoare triple {145996#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145997#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:05,793 INFO L290 TraceCheckUtils]: 110: Hoare triple {145997#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145997#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:05,794 INFO L290 TraceCheckUtils]: 111: Hoare triple {145997#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145998#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:05,794 INFO L290 TraceCheckUtils]: 112: Hoare triple {145998#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145998#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:05,794 INFO L290 TraceCheckUtils]: 113: Hoare triple {145998#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145999#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:05,795 INFO L290 TraceCheckUtils]: 114: Hoare triple {145999#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145999#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:05,795 INFO L290 TraceCheckUtils]: 115: Hoare triple {145999#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146000#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:05,795 INFO L290 TraceCheckUtils]: 116: Hoare triple {146000#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146000#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:05,795 INFO L290 TraceCheckUtils]: 117: Hoare triple {146000#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146001#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:05,796 INFO L290 TraceCheckUtils]: 118: Hoare triple {146001#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146001#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:05,796 INFO L290 TraceCheckUtils]: 119: Hoare triple {146001#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146002#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:05,796 INFO L290 TraceCheckUtils]: 120: Hoare triple {146002#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146002#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:05,797 INFO L290 TraceCheckUtils]: 121: Hoare triple {146002#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146003#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:05,797 INFO L290 TraceCheckUtils]: 122: Hoare triple {146003#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146003#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:05,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {146003#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146004#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:05,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {146004#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146004#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:05,798 INFO L290 TraceCheckUtils]: 125: Hoare triple {146004#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146005#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:05,798 INFO L290 TraceCheckUtils]: 126: Hoare triple {146005#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146005#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:05,798 INFO L290 TraceCheckUtils]: 127: Hoare triple {146005#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146006#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:05,799 INFO L290 TraceCheckUtils]: 128: Hoare triple {146006#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146006#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:05,799 INFO L290 TraceCheckUtils]: 129: Hoare triple {146006#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146007#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:05,799 INFO L290 TraceCheckUtils]: 130: Hoare triple {146007#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146007#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:05,799 INFO L290 TraceCheckUtils]: 131: Hoare triple {146007#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146008#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:05,800 INFO L290 TraceCheckUtils]: 132: Hoare triple {146008#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146008#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:05,800 INFO L290 TraceCheckUtils]: 133: Hoare triple {146008#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146009#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:05,800 INFO L290 TraceCheckUtils]: 134: Hoare triple {146009#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146009#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:05,801 INFO L290 TraceCheckUtils]: 135: Hoare triple {146009#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146010#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:05,801 INFO L290 TraceCheckUtils]: 136: Hoare triple {146010#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146010#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:05,801 INFO L290 TraceCheckUtils]: 137: Hoare triple {146010#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146011#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:05,801 INFO L290 TraceCheckUtils]: 138: Hoare triple {146011#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146011#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:05,802 INFO L290 TraceCheckUtils]: 139: Hoare triple {146011#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146012#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:05,802 INFO L290 TraceCheckUtils]: 140: Hoare triple {146012#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146012#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:05,802 INFO L290 TraceCheckUtils]: 141: Hoare triple {146012#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146013#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:05,802 INFO L290 TraceCheckUtils]: 142: Hoare triple {146013#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146013#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:05,803 INFO L290 TraceCheckUtils]: 143: Hoare triple {146013#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146014#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:05,803 INFO L290 TraceCheckUtils]: 144: Hoare triple {146014#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146014#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:05,803 INFO L290 TraceCheckUtils]: 145: Hoare triple {146014#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146015#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:05,804 INFO L290 TraceCheckUtils]: 146: Hoare triple {146015#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146015#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:05,804 INFO L290 TraceCheckUtils]: 147: Hoare triple {146015#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146016#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:05,804 INFO L290 TraceCheckUtils]: 148: Hoare triple {146016#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146016#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:05,804 INFO L290 TraceCheckUtils]: 149: Hoare triple {146016#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146017#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 150: Hoare triple {146017#(<= main_~i~0 72)} assume !(~i~0 < 1024); {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 151: Hoare triple {145941#false} ~i~0 := 0; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 152: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 153: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 154: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 155: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 156: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 157: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 158: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 159: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 160: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:05,805 INFO L290 TraceCheckUtils]: 161: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L290 TraceCheckUtils]: 162: Hoare triple {145941#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L272 TraceCheckUtils]: 163: Hoare triple {145941#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L290 TraceCheckUtils]: 164: Hoare triple {145941#false} ~cond := #in~cond; {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L290 TraceCheckUtils]: 165: Hoare triple {145941#false} assume 0 == ~cond; {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L290 TraceCheckUtils]: 166: Hoare triple {145941#false} assume !false; {145941#false} is VALID [2022-04-28 03:08:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:05,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412032359] [2022-04-28 03:08:05,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412032359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:05,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131982829] [2022-04-28 03:08:05,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:05,808 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:05,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-28 03:08:06,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:06,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:06,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-28 03:08:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:06,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:07,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {145940#true} call ULTIMATE.init(); {145940#true} is VALID [2022-04-28 03:08:07,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {145940#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(12, 2); {145940#true} is VALID [2022-04-28 03:08:07,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {145940#true} assume true; {145940#true} is VALID [2022-04-28 03:08:07,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145940#true} {145940#true} #64#return; {145940#true} is VALID [2022-04-28 03:08:07,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {145940#true} call #t~ret6 := main(); {145940#true} is VALID [2022-04-28 03:08:07,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {145940#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {146037#(<= main_~i~0 0)} is VALID [2022-04-28 03:08:07,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {146037#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146037#(<= main_~i~0 0)} is VALID [2022-04-28 03:08:07,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {146037#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145946#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:07,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {145946#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145946#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:07,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {145946#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145947#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:07,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {145947#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145947#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:07,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {145947#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145948#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:07,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {145948#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145948#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:07,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {145948#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145949#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:07,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {145949#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145949#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:07,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {145949#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145950#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:07,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {145950#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145950#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:07,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {145950#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145951#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:07,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {145951#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145951#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:07,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {145951#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145952#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:07,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {145952#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145952#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:07,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {145952#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145953#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:07,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {145953#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145953#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:07,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {145953#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145954#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:07,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {145954#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145954#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:07,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {145954#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145955#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:07,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {145955#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145955#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:07,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {145955#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145956#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:07,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {145956#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145956#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:07,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {145956#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145957#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:07,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {145957#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145957#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:07,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {145957#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145958#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:07,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {145958#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145958#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:07,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {145958#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145959#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:07,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {145959#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145959#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:07,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {145959#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145960#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:07,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {145960#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145960#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:07,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {145960#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145961#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:07,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {145961#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145961#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:07,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {145961#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145962#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:07,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {145962#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145962#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:07,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {145962#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145963#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:07,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {145963#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145963#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:07,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {145963#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145964#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:07,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {145964#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145964#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:07,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {145964#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145965#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:07,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {145965#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145965#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:07,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {145965#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145966#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:07,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {145966#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145966#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:07,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {145966#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145967#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:07,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {145967#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145967#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:07,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {145967#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145968#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:07,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {145968#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145968#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:07,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {145968#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145969#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:07,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {145969#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145969#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:07,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {145969#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145970#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:07,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {145970#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145970#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:07,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {145970#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145971#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:07,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {145971#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145971#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:07,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {145971#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145972#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:07,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {145972#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145972#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:07,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {145972#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145973#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:07,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {145973#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145973#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:07,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {145973#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145974#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:07,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {145974#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145974#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:07,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {145974#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145975#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:07,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {145975#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145975#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:07,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {145975#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145976#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:07,493 INFO L290 TraceCheckUtils]: 68: Hoare triple {145976#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145976#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:07,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {145976#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145977#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:07,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {145977#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145977#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:07,495 INFO L290 TraceCheckUtils]: 71: Hoare triple {145977#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145978#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:07,495 INFO L290 TraceCheckUtils]: 72: Hoare triple {145978#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145978#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:07,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {145978#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145979#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:07,495 INFO L290 TraceCheckUtils]: 74: Hoare triple {145979#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145979#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:07,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {145979#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145980#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:07,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {145980#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145980#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:07,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {145980#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145981#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:07,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {145981#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145981#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:07,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {145981#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145982#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:07,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {145982#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145982#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:07,498 INFO L290 TraceCheckUtils]: 81: Hoare triple {145982#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145983#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:07,498 INFO L290 TraceCheckUtils]: 82: Hoare triple {145983#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145983#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:07,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {145983#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145984#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:07,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {145984#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145984#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:07,499 INFO L290 TraceCheckUtils]: 85: Hoare triple {145984#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145985#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:07,499 INFO L290 TraceCheckUtils]: 86: Hoare triple {145985#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145985#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:07,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {145985#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145986#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:07,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {145986#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145986#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:07,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {145986#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145987#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:07,501 INFO L290 TraceCheckUtils]: 90: Hoare triple {145987#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145987#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:07,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {145987#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145988#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:07,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {145988#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145988#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:07,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {145988#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145989#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:07,502 INFO L290 TraceCheckUtils]: 94: Hoare triple {145989#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145989#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:07,502 INFO L290 TraceCheckUtils]: 95: Hoare triple {145989#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145990#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:07,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {145990#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145990#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:07,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {145990#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145991#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:07,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {145991#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145991#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:07,504 INFO L290 TraceCheckUtils]: 99: Hoare triple {145991#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145992#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:07,504 INFO L290 TraceCheckUtils]: 100: Hoare triple {145992#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145992#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:07,504 INFO L290 TraceCheckUtils]: 101: Hoare triple {145992#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145993#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:07,505 INFO L290 TraceCheckUtils]: 102: Hoare triple {145993#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145993#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:07,505 INFO L290 TraceCheckUtils]: 103: Hoare triple {145993#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145994#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:07,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {145994#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145994#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:07,506 INFO L290 TraceCheckUtils]: 105: Hoare triple {145994#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145995#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:07,506 INFO L290 TraceCheckUtils]: 106: Hoare triple {145995#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145995#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:07,506 INFO L290 TraceCheckUtils]: 107: Hoare triple {145995#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145996#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:07,507 INFO L290 TraceCheckUtils]: 108: Hoare triple {145996#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145996#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:07,507 INFO L290 TraceCheckUtils]: 109: Hoare triple {145996#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145997#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:07,507 INFO L290 TraceCheckUtils]: 110: Hoare triple {145997#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145997#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:07,508 INFO L290 TraceCheckUtils]: 111: Hoare triple {145997#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145998#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:07,508 INFO L290 TraceCheckUtils]: 112: Hoare triple {145998#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145998#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:07,508 INFO L290 TraceCheckUtils]: 113: Hoare triple {145998#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {145999#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:07,509 INFO L290 TraceCheckUtils]: 114: Hoare triple {145999#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {145999#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:07,509 INFO L290 TraceCheckUtils]: 115: Hoare triple {145999#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146000#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:07,509 INFO L290 TraceCheckUtils]: 116: Hoare triple {146000#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146000#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:07,510 INFO L290 TraceCheckUtils]: 117: Hoare triple {146000#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146001#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:07,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {146001#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146001#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:07,510 INFO L290 TraceCheckUtils]: 119: Hoare triple {146001#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146002#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:07,510 INFO L290 TraceCheckUtils]: 120: Hoare triple {146002#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146002#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:07,511 INFO L290 TraceCheckUtils]: 121: Hoare triple {146002#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146003#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:07,511 INFO L290 TraceCheckUtils]: 122: Hoare triple {146003#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146003#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:07,512 INFO L290 TraceCheckUtils]: 123: Hoare triple {146003#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146004#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:07,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {146004#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146004#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:07,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {146004#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146005#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:07,512 INFO L290 TraceCheckUtils]: 126: Hoare triple {146005#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146005#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:07,513 INFO L290 TraceCheckUtils]: 127: Hoare triple {146005#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146006#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:07,513 INFO L290 TraceCheckUtils]: 128: Hoare triple {146006#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146006#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:07,513 INFO L290 TraceCheckUtils]: 129: Hoare triple {146006#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146007#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:07,514 INFO L290 TraceCheckUtils]: 130: Hoare triple {146007#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146007#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:07,514 INFO L290 TraceCheckUtils]: 131: Hoare triple {146007#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146008#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:07,514 INFO L290 TraceCheckUtils]: 132: Hoare triple {146008#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146008#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:07,515 INFO L290 TraceCheckUtils]: 133: Hoare triple {146008#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146009#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:07,515 INFO L290 TraceCheckUtils]: 134: Hoare triple {146009#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146009#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:07,515 INFO L290 TraceCheckUtils]: 135: Hoare triple {146009#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146010#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:07,516 INFO L290 TraceCheckUtils]: 136: Hoare triple {146010#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146010#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:07,516 INFO L290 TraceCheckUtils]: 137: Hoare triple {146010#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146011#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:07,516 INFO L290 TraceCheckUtils]: 138: Hoare triple {146011#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146011#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:07,517 INFO L290 TraceCheckUtils]: 139: Hoare triple {146011#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146012#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:07,517 INFO L290 TraceCheckUtils]: 140: Hoare triple {146012#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146012#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:07,517 INFO L290 TraceCheckUtils]: 141: Hoare triple {146012#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146013#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:07,518 INFO L290 TraceCheckUtils]: 142: Hoare triple {146013#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146013#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:07,518 INFO L290 TraceCheckUtils]: 143: Hoare triple {146013#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146014#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:07,518 INFO L290 TraceCheckUtils]: 144: Hoare triple {146014#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146014#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:07,519 INFO L290 TraceCheckUtils]: 145: Hoare triple {146014#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146015#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:07,519 INFO L290 TraceCheckUtils]: 146: Hoare triple {146015#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146015#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:07,519 INFO L290 TraceCheckUtils]: 147: Hoare triple {146015#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146016#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:07,520 INFO L290 TraceCheckUtils]: 148: Hoare triple {146016#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146016#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:07,520 INFO L290 TraceCheckUtils]: 149: Hoare triple {146016#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146017#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:07,520 INFO L290 TraceCheckUtils]: 150: Hoare triple {146017#(<= main_~i~0 72)} assume !(~i~0 < 1024); {145941#false} is VALID [2022-04-28 03:08:07,520 INFO L290 TraceCheckUtils]: 151: Hoare triple {145941#false} ~i~0 := 0; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 152: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 153: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 154: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 155: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 156: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 157: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 158: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 159: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 160: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 161: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 162: Hoare triple {145941#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L272 TraceCheckUtils]: 163: Hoare triple {145941#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 164: Hoare triple {145941#false} ~cond := #in~cond; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 165: Hoare triple {145941#false} assume 0 == ~cond; {145941#false} is VALID [2022-04-28 03:08:07,521 INFO L290 TraceCheckUtils]: 166: Hoare triple {145941#false} assume !false; {145941#false} is VALID [2022-04-28 03:08:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:07,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:11,540 INFO L290 TraceCheckUtils]: 166: Hoare triple {145941#false} assume !false; {145941#false} is VALID [2022-04-28 03:08:11,540 INFO L290 TraceCheckUtils]: 165: Hoare triple {145941#false} assume 0 == ~cond; {145941#false} is VALID [2022-04-28 03:08:11,540 INFO L290 TraceCheckUtils]: 164: Hoare triple {145941#false} ~cond := #in~cond; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L272 TraceCheckUtils]: 163: Hoare triple {145941#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 162: Hoare triple {145941#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 161: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 160: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 159: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 158: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 157: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 156: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 155: Hoare triple {145941#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 154: Hoare triple {145941#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 153: Hoare triple {145941#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 152: Hoare triple {145941#false} #t~short5 := ~i~0 < 1024; {145941#false} is VALID [2022-04-28 03:08:11,541 INFO L290 TraceCheckUtils]: 151: Hoare triple {145941#false} ~i~0 := 0; {145941#false} is VALID [2022-04-28 03:08:11,542 INFO L290 TraceCheckUtils]: 150: Hoare triple {146569#(< main_~i~0 1024)} assume !(~i~0 < 1024); {145941#false} is VALID [2022-04-28 03:08:11,542 INFO L290 TraceCheckUtils]: 149: Hoare triple {146573#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146569#(< main_~i~0 1024)} is VALID [2022-04-28 03:08:11,542 INFO L290 TraceCheckUtils]: 148: Hoare triple {146573#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146573#(< main_~i~0 1023)} is VALID [2022-04-28 03:08:11,542 INFO L290 TraceCheckUtils]: 147: Hoare triple {146580#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146573#(< main_~i~0 1023)} is VALID [2022-04-28 03:08:11,542 INFO L290 TraceCheckUtils]: 146: Hoare triple {146580#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146580#(< main_~i~0 1022)} is VALID [2022-04-28 03:08:11,543 INFO L290 TraceCheckUtils]: 145: Hoare triple {146587#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146580#(< main_~i~0 1022)} is VALID [2022-04-28 03:08:11,543 INFO L290 TraceCheckUtils]: 144: Hoare triple {146587#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146587#(< main_~i~0 1021)} is VALID [2022-04-28 03:08:11,543 INFO L290 TraceCheckUtils]: 143: Hoare triple {146594#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146587#(< main_~i~0 1021)} is VALID [2022-04-28 03:08:11,543 INFO L290 TraceCheckUtils]: 142: Hoare triple {146594#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146594#(< main_~i~0 1020)} is VALID [2022-04-28 03:08:11,544 INFO L290 TraceCheckUtils]: 141: Hoare triple {146601#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146594#(< main_~i~0 1020)} is VALID [2022-04-28 03:08:11,544 INFO L290 TraceCheckUtils]: 140: Hoare triple {146601#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146601#(< main_~i~0 1019)} is VALID [2022-04-28 03:08:11,544 INFO L290 TraceCheckUtils]: 139: Hoare triple {146608#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146601#(< main_~i~0 1019)} is VALID [2022-04-28 03:08:11,544 INFO L290 TraceCheckUtils]: 138: Hoare triple {146608#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146608#(< main_~i~0 1018)} is VALID [2022-04-28 03:08:11,545 INFO L290 TraceCheckUtils]: 137: Hoare triple {146615#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146608#(< main_~i~0 1018)} is VALID [2022-04-28 03:08:11,545 INFO L290 TraceCheckUtils]: 136: Hoare triple {146615#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146615#(< main_~i~0 1017)} is VALID [2022-04-28 03:08:11,545 INFO L290 TraceCheckUtils]: 135: Hoare triple {146622#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146615#(< main_~i~0 1017)} is VALID [2022-04-28 03:08:11,545 INFO L290 TraceCheckUtils]: 134: Hoare triple {146622#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146622#(< main_~i~0 1016)} is VALID [2022-04-28 03:08:11,545 INFO L290 TraceCheckUtils]: 133: Hoare triple {146629#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146622#(< main_~i~0 1016)} is VALID [2022-04-28 03:08:11,546 INFO L290 TraceCheckUtils]: 132: Hoare triple {146629#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146629#(< main_~i~0 1015)} is VALID [2022-04-28 03:08:11,546 INFO L290 TraceCheckUtils]: 131: Hoare triple {146636#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146629#(< main_~i~0 1015)} is VALID [2022-04-28 03:08:11,546 INFO L290 TraceCheckUtils]: 130: Hoare triple {146636#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146636#(< main_~i~0 1014)} is VALID [2022-04-28 03:08:11,546 INFO L290 TraceCheckUtils]: 129: Hoare triple {146643#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146636#(< main_~i~0 1014)} is VALID [2022-04-28 03:08:11,546 INFO L290 TraceCheckUtils]: 128: Hoare triple {146643#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146643#(< main_~i~0 1013)} is VALID [2022-04-28 03:08:11,547 INFO L290 TraceCheckUtils]: 127: Hoare triple {146650#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146643#(< main_~i~0 1013)} is VALID [2022-04-28 03:08:11,547 INFO L290 TraceCheckUtils]: 126: Hoare triple {146650#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146650#(< main_~i~0 1012)} is VALID [2022-04-28 03:08:11,547 INFO L290 TraceCheckUtils]: 125: Hoare triple {146657#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146650#(< main_~i~0 1012)} is VALID [2022-04-28 03:08:11,547 INFO L290 TraceCheckUtils]: 124: Hoare triple {146657#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146657#(< main_~i~0 1011)} is VALID [2022-04-28 03:08:11,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {146664#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146657#(< main_~i~0 1011)} is VALID [2022-04-28 03:08:11,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {146664#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146664#(< main_~i~0 1010)} is VALID [2022-04-28 03:08:11,548 INFO L290 TraceCheckUtils]: 121: Hoare triple {146671#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146664#(< main_~i~0 1010)} is VALID [2022-04-28 03:08:11,548 INFO L290 TraceCheckUtils]: 120: Hoare triple {146671#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146671#(< main_~i~0 1009)} is VALID [2022-04-28 03:08:11,549 INFO L290 TraceCheckUtils]: 119: Hoare triple {146678#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146671#(< main_~i~0 1009)} is VALID [2022-04-28 03:08:11,549 INFO L290 TraceCheckUtils]: 118: Hoare triple {146678#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146678#(< main_~i~0 1008)} is VALID [2022-04-28 03:08:11,549 INFO L290 TraceCheckUtils]: 117: Hoare triple {146685#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146678#(< main_~i~0 1008)} is VALID [2022-04-28 03:08:11,549 INFO L290 TraceCheckUtils]: 116: Hoare triple {146685#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146685#(< main_~i~0 1007)} is VALID [2022-04-28 03:08:11,549 INFO L290 TraceCheckUtils]: 115: Hoare triple {146692#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146685#(< main_~i~0 1007)} is VALID [2022-04-28 03:08:11,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {146692#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146692#(< main_~i~0 1006)} is VALID [2022-04-28 03:08:11,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {146699#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146692#(< main_~i~0 1006)} is VALID [2022-04-28 03:08:11,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {146699#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146699#(< main_~i~0 1005)} is VALID [2022-04-28 03:08:11,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {146706#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146699#(< main_~i~0 1005)} is VALID [2022-04-28 03:08:11,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {146706#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146706#(< main_~i~0 1004)} is VALID [2022-04-28 03:08:11,551 INFO L290 TraceCheckUtils]: 109: Hoare triple {146713#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146706#(< main_~i~0 1004)} is VALID [2022-04-28 03:08:11,551 INFO L290 TraceCheckUtils]: 108: Hoare triple {146713#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146713#(< main_~i~0 1003)} is VALID [2022-04-28 03:08:11,551 INFO L290 TraceCheckUtils]: 107: Hoare triple {146720#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146713#(< main_~i~0 1003)} is VALID [2022-04-28 03:08:11,551 INFO L290 TraceCheckUtils]: 106: Hoare triple {146720#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146720#(< main_~i~0 1002)} is VALID [2022-04-28 03:08:11,552 INFO L290 TraceCheckUtils]: 105: Hoare triple {146727#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146720#(< main_~i~0 1002)} is VALID [2022-04-28 03:08:11,552 INFO L290 TraceCheckUtils]: 104: Hoare triple {146727#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146727#(< main_~i~0 1001)} is VALID [2022-04-28 03:08:11,552 INFO L290 TraceCheckUtils]: 103: Hoare triple {146734#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146727#(< main_~i~0 1001)} is VALID [2022-04-28 03:08:11,552 INFO L290 TraceCheckUtils]: 102: Hoare triple {146734#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146734#(< main_~i~0 1000)} is VALID [2022-04-28 03:08:11,553 INFO L290 TraceCheckUtils]: 101: Hoare triple {146741#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146734#(< main_~i~0 1000)} is VALID [2022-04-28 03:08:11,553 INFO L290 TraceCheckUtils]: 100: Hoare triple {146741#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146741#(< main_~i~0 999)} is VALID [2022-04-28 03:08:11,553 INFO L290 TraceCheckUtils]: 99: Hoare triple {146748#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146741#(< main_~i~0 999)} is VALID [2022-04-28 03:08:11,553 INFO L290 TraceCheckUtils]: 98: Hoare triple {146748#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146748#(< main_~i~0 998)} is VALID [2022-04-28 03:08:11,553 INFO L290 TraceCheckUtils]: 97: Hoare triple {146755#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146748#(< main_~i~0 998)} is VALID [2022-04-28 03:08:11,554 INFO L290 TraceCheckUtils]: 96: Hoare triple {146755#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146755#(< main_~i~0 997)} is VALID [2022-04-28 03:08:11,554 INFO L290 TraceCheckUtils]: 95: Hoare triple {146762#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146755#(< main_~i~0 997)} is VALID [2022-04-28 03:08:11,554 INFO L290 TraceCheckUtils]: 94: Hoare triple {146762#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146762#(< main_~i~0 996)} is VALID [2022-04-28 03:08:11,554 INFO L290 TraceCheckUtils]: 93: Hoare triple {146769#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146762#(< main_~i~0 996)} is VALID [2022-04-28 03:08:11,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {146769#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146769#(< main_~i~0 995)} is VALID [2022-04-28 03:08:11,555 INFO L290 TraceCheckUtils]: 91: Hoare triple {146776#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146769#(< main_~i~0 995)} is VALID [2022-04-28 03:08:11,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {146776#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146776#(< main_~i~0 994)} is VALID [2022-04-28 03:08:11,555 INFO L290 TraceCheckUtils]: 89: Hoare triple {146783#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146776#(< main_~i~0 994)} is VALID [2022-04-28 03:08:11,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {146783#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146783#(< main_~i~0 993)} is VALID [2022-04-28 03:08:11,556 INFO L290 TraceCheckUtils]: 87: Hoare triple {146790#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146783#(< main_~i~0 993)} is VALID [2022-04-28 03:08:11,556 INFO L290 TraceCheckUtils]: 86: Hoare triple {146790#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146790#(< main_~i~0 992)} is VALID [2022-04-28 03:08:11,556 INFO L290 TraceCheckUtils]: 85: Hoare triple {146797#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146790#(< main_~i~0 992)} is VALID [2022-04-28 03:08:11,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {146797#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146797#(< main_~i~0 991)} is VALID [2022-04-28 03:08:11,557 INFO L290 TraceCheckUtils]: 83: Hoare triple {146804#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146797#(< main_~i~0 991)} is VALID [2022-04-28 03:08:11,557 INFO L290 TraceCheckUtils]: 82: Hoare triple {146804#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146804#(< main_~i~0 990)} is VALID [2022-04-28 03:08:11,557 INFO L290 TraceCheckUtils]: 81: Hoare triple {146811#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146804#(< main_~i~0 990)} is VALID [2022-04-28 03:08:11,557 INFO L290 TraceCheckUtils]: 80: Hoare triple {146811#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146811#(< main_~i~0 989)} is VALID [2022-04-28 03:08:11,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {146818#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146811#(< main_~i~0 989)} is VALID [2022-04-28 03:08:11,558 INFO L290 TraceCheckUtils]: 78: Hoare triple {146818#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146818#(< main_~i~0 988)} is VALID [2022-04-28 03:08:11,558 INFO L290 TraceCheckUtils]: 77: Hoare triple {146825#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146818#(< main_~i~0 988)} is VALID [2022-04-28 03:08:11,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {146825#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146825#(< main_~i~0 987)} is VALID [2022-04-28 03:08:11,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {146832#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146825#(< main_~i~0 987)} is VALID [2022-04-28 03:08:11,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {146832#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146832#(< main_~i~0 986)} is VALID [2022-04-28 03:08:11,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {146839#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146832#(< main_~i~0 986)} is VALID [2022-04-28 03:08:11,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {146839#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146839#(< main_~i~0 985)} is VALID [2022-04-28 03:08:11,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {146846#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146839#(< main_~i~0 985)} is VALID [2022-04-28 03:08:11,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {146846#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146846#(< main_~i~0 984)} is VALID [2022-04-28 03:08:11,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {146853#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146846#(< main_~i~0 984)} is VALID [2022-04-28 03:08:11,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {146853#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146853#(< main_~i~0 983)} is VALID [2022-04-28 03:08:11,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {146860#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146853#(< main_~i~0 983)} is VALID [2022-04-28 03:08:11,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {146860#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146860#(< main_~i~0 982)} is VALID [2022-04-28 03:08:11,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {146867#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146860#(< main_~i~0 982)} is VALID [2022-04-28 03:08:11,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {146867#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146867#(< main_~i~0 981)} is VALID [2022-04-28 03:08:11,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {146874#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146867#(< main_~i~0 981)} is VALID [2022-04-28 03:08:11,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {146874#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146874#(< main_~i~0 980)} is VALID [2022-04-28 03:08:11,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {146881#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146874#(< main_~i~0 980)} is VALID [2022-04-28 03:08:11,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {146881#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146881#(< main_~i~0 979)} is VALID [2022-04-28 03:08:11,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {146888#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146881#(< main_~i~0 979)} is VALID [2022-04-28 03:08:11,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {146888#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146888#(< main_~i~0 978)} is VALID [2022-04-28 03:08:11,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {146895#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146888#(< main_~i~0 978)} is VALID [2022-04-28 03:08:11,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {146895#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146895#(< main_~i~0 977)} is VALID [2022-04-28 03:08:11,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {146902#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146895#(< main_~i~0 977)} is VALID [2022-04-28 03:08:11,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {146902#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146902#(< main_~i~0 976)} is VALID [2022-04-28 03:08:11,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {146909#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146902#(< main_~i~0 976)} is VALID [2022-04-28 03:08:11,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {146909#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146909#(< main_~i~0 975)} is VALID [2022-04-28 03:08:11,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {146916#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146909#(< main_~i~0 975)} is VALID [2022-04-28 03:08:11,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {146916#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146916#(< main_~i~0 974)} is VALID [2022-04-28 03:08:11,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {146923#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146916#(< main_~i~0 974)} is VALID [2022-04-28 03:08:11,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {146923#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146923#(< main_~i~0 973)} is VALID [2022-04-28 03:08:11,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {146930#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146923#(< main_~i~0 973)} is VALID [2022-04-28 03:08:11,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {146930#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146930#(< main_~i~0 972)} is VALID [2022-04-28 03:08:11,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {146937#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146930#(< main_~i~0 972)} is VALID [2022-04-28 03:08:11,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {146937#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146937#(< main_~i~0 971)} is VALID [2022-04-28 03:08:11,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {146944#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146937#(< main_~i~0 971)} is VALID [2022-04-28 03:08:11,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {146944#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146944#(< main_~i~0 970)} is VALID [2022-04-28 03:08:11,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {146951#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146944#(< main_~i~0 970)} is VALID [2022-04-28 03:08:11,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {146951#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146951#(< main_~i~0 969)} is VALID [2022-04-28 03:08:11,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {146958#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146951#(< main_~i~0 969)} is VALID [2022-04-28 03:08:11,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {146958#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146958#(< main_~i~0 968)} is VALID [2022-04-28 03:08:11,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {146965#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146958#(< main_~i~0 968)} is VALID [2022-04-28 03:08:11,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {146965#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146965#(< main_~i~0 967)} is VALID [2022-04-28 03:08:11,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {146972#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146965#(< main_~i~0 967)} is VALID [2022-04-28 03:08:11,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {146972#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146972#(< main_~i~0 966)} is VALID [2022-04-28 03:08:11,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {146979#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146972#(< main_~i~0 966)} is VALID [2022-04-28 03:08:11,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {146979#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146979#(< main_~i~0 965)} is VALID [2022-04-28 03:08:11,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {146986#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146979#(< main_~i~0 965)} is VALID [2022-04-28 03:08:11,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {146986#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146986#(< main_~i~0 964)} is VALID [2022-04-28 03:08:11,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {146993#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146986#(< main_~i~0 964)} is VALID [2022-04-28 03:08:11,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {146993#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {146993#(< main_~i~0 963)} is VALID [2022-04-28 03:08:11,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {147000#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146993#(< main_~i~0 963)} is VALID [2022-04-28 03:08:11,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {147000#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147000#(< main_~i~0 962)} is VALID [2022-04-28 03:08:11,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {147007#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147000#(< main_~i~0 962)} is VALID [2022-04-28 03:08:11,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {147007#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147007#(< main_~i~0 961)} is VALID [2022-04-28 03:08:11,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {147014#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147007#(< main_~i~0 961)} is VALID [2022-04-28 03:08:11,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {147014#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147014#(< main_~i~0 960)} is VALID [2022-04-28 03:08:11,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {147021#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147014#(< main_~i~0 960)} is VALID [2022-04-28 03:08:11,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {147021#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147021#(< main_~i~0 959)} is VALID [2022-04-28 03:08:11,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {147028#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147021#(< main_~i~0 959)} is VALID [2022-04-28 03:08:11,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {147028#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147028#(< main_~i~0 958)} is VALID [2022-04-28 03:08:11,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {147035#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147028#(< main_~i~0 958)} is VALID [2022-04-28 03:08:11,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {147035#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147035#(< main_~i~0 957)} is VALID [2022-04-28 03:08:11,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {147042#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147035#(< main_~i~0 957)} is VALID [2022-04-28 03:08:11,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {147042#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147042#(< main_~i~0 956)} is VALID [2022-04-28 03:08:11,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {147049#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147042#(< main_~i~0 956)} is VALID [2022-04-28 03:08:11,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {147049#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147049#(< main_~i~0 955)} is VALID [2022-04-28 03:08:11,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {147056#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147049#(< main_~i~0 955)} is VALID [2022-04-28 03:08:11,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {147056#(< main_~i~0 954)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147056#(< main_~i~0 954)} is VALID [2022-04-28 03:08:11,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {147063#(< main_~i~0 953)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147056#(< main_~i~0 954)} is VALID [2022-04-28 03:08:11,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {147063#(< main_~i~0 953)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147063#(< main_~i~0 953)} is VALID [2022-04-28 03:08:11,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {147070#(< main_~i~0 952)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {147063#(< main_~i~0 953)} is VALID [2022-04-28 03:08:11,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {147070#(< main_~i~0 952)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {147070#(< main_~i~0 952)} is VALID [2022-04-28 03:08:11,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {145940#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {147070#(< main_~i~0 952)} is VALID [2022-04-28 03:08:11,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {145940#true} call #t~ret6 := main(); {145940#true} is VALID [2022-04-28 03:08:11,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145940#true} {145940#true} #64#return; {145940#true} is VALID [2022-04-28 03:08:11,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {145940#true} assume true; {145940#true} is VALID [2022-04-28 03:08:11,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {145940#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(12, 2); {145940#true} is VALID [2022-04-28 03:08:11,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {145940#true} call ULTIMATE.init(); {145940#true} is VALID [2022-04-28 03:08:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131982829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:11,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:11,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 75, 75] total 150 [2022-04-28 03:08:11,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1949071962] [2022-04-28 03:08:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1949071962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:11,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:11,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-28 03:08:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069662916] [2022-04-28 03:08:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:11,576 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 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 167 [2022-04-28 03:08:11,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:11,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:11,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-28 03:08:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-28 03:08:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11028, Invalid=11322, Unknown=0, NotChecked=0, Total=22350 [2022-04-28 03:08:11,641 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:31,903 INFO L93 Difference]: Finished difference Result 544 states and 694 transitions. [2022-04-28 03:08:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-28 03:08:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 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 167 [2022-04-28 03:08:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 685 transitions. [2022-04-28 03:08:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 685 transitions. [2022-04-28 03:08:31,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 685 transitions. [2022-04-28 03:08:32,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:32,220 INFO L225 Difference]: With dead ends: 544 [2022-04-28 03:08:32,220 INFO L226 Difference]: Without dead ends: 527 [2022-04-28 03:08:32,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3059 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=21906, Invalid=27600, Unknown=0, NotChecked=0, Total=49506 [2022-04-28 03:08:32,223 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1842 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:32,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 52 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:08:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-04-28 03:08:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 170. [2022-04-28 03:08:33,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:33,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:33,411 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:33,411 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:33,419 INFO L93 Difference]: Finished difference Result 527 states and 673 transitions. [2022-04-28 03:08:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 673 transitions. [2022-04-28 03:08:33,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:33,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:33,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 527 states. [2022-04-28 03:08:33,420 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 527 states. [2022-04-28 03:08:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:33,427 INFO L93 Difference]: Finished difference Result 527 states and 673 transitions. [2022-04-28 03:08:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 673 transitions. [2022-04-28 03:08:33,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:33,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:33,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:33,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.0303030303030303) internal successors, (170), 165 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2022-04-28 03:08:33,430 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 167 [2022-04-28 03:08:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:33,430 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2022-04-28 03:08:33,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 75 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:33,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 174 transitions. [2022-04-28 03:08:33,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2022-04-28 03:08:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-28 03:08:33,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:33,896 INFO L195 NwaCegarLoop]: trace histogram [73, 73, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:33,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:34,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:34,114 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1812094411, now seen corresponding path program 147 times [2022-04-28 03:08:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:34,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097700400] [2022-04-28 03:08:34,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:34,120 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:34,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1812094411, now seen corresponding path program 148 times [2022-04-28 03:08:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:34,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325821852] [2022-04-28 03:08:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {149801#(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(12, 2); {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {149722#true} assume true; {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149722#true} {149722#true} #64#return; {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {149722#true} call ULTIMATE.init(); {149801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:35,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {149801#(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(12, 2); {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {149722#true} assume true; {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149722#true} {149722#true} #64#return; {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {149722#true} call #t~ret6 := main(); {149722#true} is VALID [2022-04-28 03:08:35,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {149722#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {149727#(= main_~i~0 0)} is VALID [2022-04-28 03:08:35,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {149727#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149727#(= main_~i~0 0)} is VALID [2022-04-28 03:08:35,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {149727#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149728#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:35,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {149728#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149728#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:35,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {149728#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149729#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:35,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {149729#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149729#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:35,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {149729#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149730#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:35,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {149730#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149730#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:35,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {149730#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149731#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:35,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {149731#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149731#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:35,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {149731#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149732#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:35,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {149732#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149732#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:35,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {149732#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149733#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:35,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {149733#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149733#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:35,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {149733#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149734#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:35,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {149734#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149734#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:35,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {149734#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149735#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:35,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {149735#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149735#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:35,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {149735#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149736#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:35,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {149736#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149736#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:35,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {149736#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149737#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:35,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {149737#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149737#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:35,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {149737#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149738#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:35,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {149738#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149738#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:35,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {149738#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149739#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:35,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {149739#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149739#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:35,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {149739#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149740#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:35,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {149740#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149740#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:35,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {149740#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149741#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:35,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {149741#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149741#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:35,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {149741#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149742#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:35,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {149742#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149742#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:35,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {149742#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149743#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:35,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {149743#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149743#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:35,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {149743#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149744#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:35,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {149744#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149744#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:35,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {149744#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149745#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:35,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {149745#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149745#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:35,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {149745#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149746#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:35,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {149746#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149746#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:35,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {149746#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149747#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:35,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {149747#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149747#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:35,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {149747#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149748#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:35,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {149748#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149748#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:35,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {149748#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149749#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:35,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {149749#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149749#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:35,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {149749#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149750#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:35,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {149750#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149750#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:35,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {149750#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149751#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:35,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {149751#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149751#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:35,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {149751#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149752#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:35,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {149752#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149752#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:35,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {149752#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149753#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:35,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {149753#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149753#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:35,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {149753#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149754#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:35,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {149754#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149754#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:35,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {149754#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149755#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:35,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {149755#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149755#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:35,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {149755#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149756#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:35,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {149756#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149756#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:35,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {149756#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149757#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:35,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {149757#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149757#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:35,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {149757#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149758#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:35,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {149758#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149758#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:35,299 INFO L290 TraceCheckUtils]: 69: Hoare triple {149758#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149759#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:35,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {149759#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149759#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:35,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {149759#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149760#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:35,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {149760#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149760#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:35,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {149760#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149761#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:35,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {149761#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149761#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:35,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {149761#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149762#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:35,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {149762#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149762#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:35,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {149762#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149763#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:35,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {149763#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149763#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:35,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {149763#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149764#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:35,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {149764#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149764#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:35,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {149764#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149765#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:35,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {149765#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149765#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:35,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {149765#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149766#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:35,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {149766#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149766#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:35,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {149766#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149767#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:35,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {149767#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149767#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:35,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {149767#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149768#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:35,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {149768#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149768#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:35,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {149768#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149769#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:35,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {149769#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149769#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:35,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {149769#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149770#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:35,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {149770#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149770#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:35,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {149770#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149771#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:35,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {149771#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149771#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:35,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {149771#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149772#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:35,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {149772#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149772#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:35,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {149772#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149773#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:35,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {149773#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149773#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:35,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {149773#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149774#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:35,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {149774#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149774#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:35,306 INFO L290 TraceCheckUtils]: 101: Hoare triple {149774#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149775#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:35,306 INFO L290 TraceCheckUtils]: 102: Hoare triple {149775#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149775#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:35,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {149775#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149776#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:35,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {149776#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149776#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:35,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {149776#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149777#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:35,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {149777#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149777#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:35,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {149777#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149778#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:35,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {149778#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149778#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:35,308 INFO L290 TraceCheckUtils]: 109: Hoare triple {149778#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149779#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:35,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {149779#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149779#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:35,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {149779#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149780#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:35,309 INFO L290 TraceCheckUtils]: 112: Hoare triple {149780#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149780#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:35,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {149780#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149781#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:35,309 INFO L290 TraceCheckUtils]: 114: Hoare triple {149781#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149781#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:35,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {149781#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149782#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:35,310 INFO L290 TraceCheckUtils]: 116: Hoare triple {149782#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149782#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:35,310 INFO L290 TraceCheckUtils]: 117: Hoare triple {149782#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149783#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:35,310 INFO L290 TraceCheckUtils]: 118: Hoare triple {149783#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149783#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:35,310 INFO L290 TraceCheckUtils]: 119: Hoare triple {149783#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149784#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:35,310 INFO L290 TraceCheckUtils]: 120: Hoare triple {149784#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149784#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:35,311 INFO L290 TraceCheckUtils]: 121: Hoare triple {149784#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149785#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:35,311 INFO L290 TraceCheckUtils]: 122: Hoare triple {149785#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149785#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:35,311 INFO L290 TraceCheckUtils]: 123: Hoare triple {149785#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149786#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:35,311 INFO L290 TraceCheckUtils]: 124: Hoare triple {149786#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149786#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:35,312 INFO L290 TraceCheckUtils]: 125: Hoare triple {149786#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149787#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:35,312 INFO L290 TraceCheckUtils]: 126: Hoare triple {149787#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149787#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:35,312 INFO L290 TraceCheckUtils]: 127: Hoare triple {149787#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149788#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:35,312 INFO L290 TraceCheckUtils]: 128: Hoare triple {149788#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149788#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:35,312 INFO L290 TraceCheckUtils]: 129: Hoare triple {149788#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149789#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:35,313 INFO L290 TraceCheckUtils]: 130: Hoare triple {149789#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149789#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:35,313 INFO L290 TraceCheckUtils]: 131: Hoare triple {149789#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149790#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:35,313 INFO L290 TraceCheckUtils]: 132: Hoare triple {149790#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149790#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:35,313 INFO L290 TraceCheckUtils]: 133: Hoare triple {149790#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149791#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:35,313 INFO L290 TraceCheckUtils]: 134: Hoare triple {149791#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149791#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:35,314 INFO L290 TraceCheckUtils]: 135: Hoare triple {149791#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149792#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:35,314 INFO L290 TraceCheckUtils]: 136: Hoare triple {149792#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149792#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:35,314 INFO L290 TraceCheckUtils]: 137: Hoare triple {149792#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149793#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:35,314 INFO L290 TraceCheckUtils]: 138: Hoare triple {149793#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149793#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:35,315 INFO L290 TraceCheckUtils]: 139: Hoare triple {149793#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149794#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:35,315 INFO L290 TraceCheckUtils]: 140: Hoare triple {149794#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149794#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:35,315 INFO L290 TraceCheckUtils]: 141: Hoare triple {149794#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149795#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:35,315 INFO L290 TraceCheckUtils]: 142: Hoare triple {149795#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149795#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:35,316 INFO L290 TraceCheckUtils]: 143: Hoare triple {149795#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149796#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:35,316 INFO L290 TraceCheckUtils]: 144: Hoare triple {149796#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149796#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:35,316 INFO L290 TraceCheckUtils]: 145: Hoare triple {149796#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149797#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:35,316 INFO L290 TraceCheckUtils]: 146: Hoare triple {149797#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149797#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:35,316 INFO L290 TraceCheckUtils]: 147: Hoare triple {149797#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149798#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:35,317 INFO L290 TraceCheckUtils]: 148: Hoare triple {149798#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149798#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:35,317 INFO L290 TraceCheckUtils]: 149: Hoare triple {149798#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149799#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:35,317 INFO L290 TraceCheckUtils]: 150: Hoare triple {149799#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149799#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:35,317 INFO L290 TraceCheckUtils]: 151: Hoare triple {149799#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149800#(<= main_~i~0 73)} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 152: Hoare triple {149800#(<= main_~i~0 73)} assume !(~i~0 < 1024); {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 153: Hoare triple {149723#false} ~i~0 := 0; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 154: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 155: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 156: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 157: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 158: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 159: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 160: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 161: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 162: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 163: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 164: Hoare triple {149723#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L272 TraceCheckUtils]: 165: Hoare triple {149723#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 166: Hoare triple {149723#false} ~cond := #in~cond; {149723#false} is VALID [2022-04-28 03:08:35,318 INFO L290 TraceCheckUtils]: 167: Hoare triple {149723#false} assume 0 == ~cond; {149723#false} is VALID [2022-04-28 03:08:35,319 INFO L290 TraceCheckUtils]: 168: Hoare triple {149723#false} assume !false; {149723#false} is VALID [2022-04-28 03:08:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5339 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:35,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325821852] [2022-04-28 03:08:35,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325821852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:35,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674431868] [2022-04-28 03:08:35,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:08:35,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:35,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:35,321 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:35,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-28 03:08:35,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:08:35,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:35,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 75 conjunts are in the unsatisfiable core [2022-04-28 03:08:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:36,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {149722#true} call ULTIMATE.init(); {149722#true} is VALID [2022-04-28 03:08:36,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {149722#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(12, 2); {149722#true} is VALID [2022-04-28 03:08:36,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {149722#true} assume true; {149722#true} is VALID [2022-04-28 03:08:36,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149722#true} {149722#true} #64#return; {149722#true} is VALID [2022-04-28 03:08:36,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {149722#true} call #t~ret6 := main(); {149722#true} is VALID [2022-04-28 03:08:36,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {149722#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {149820#(<= main_~i~0 0)} is VALID [2022-04-28 03:08:36,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {149820#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149820#(<= main_~i~0 0)} is VALID [2022-04-28 03:08:36,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {149820#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149728#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:36,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {149728#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149728#(<= main_~i~0 1)} is VALID [2022-04-28 03:08:36,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {149728#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149729#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:36,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {149729#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149729#(<= main_~i~0 2)} is VALID [2022-04-28 03:08:36,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {149729#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149730#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:36,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {149730#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149730#(<= main_~i~0 3)} is VALID [2022-04-28 03:08:36,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {149730#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149731#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:36,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {149731#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149731#(<= main_~i~0 4)} is VALID [2022-04-28 03:08:36,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {149731#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149732#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:36,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {149732#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149732#(<= main_~i~0 5)} is VALID [2022-04-28 03:08:36,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {149732#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149733#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:36,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {149733#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149733#(<= main_~i~0 6)} is VALID [2022-04-28 03:08:36,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {149733#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149734#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:36,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {149734#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149734#(<= main_~i~0 7)} is VALID [2022-04-28 03:08:36,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {149734#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149735#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:36,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {149735#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149735#(<= main_~i~0 8)} is VALID [2022-04-28 03:08:36,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {149735#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149736#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:36,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {149736#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149736#(<= main_~i~0 9)} is VALID [2022-04-28 03:08:36,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {149736#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149737#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:36,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {149737#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149737#(<= main_~i~0 10)} is VALID [2022-04-28 03:08:36,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {149737#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149738#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:36,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {149738#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149738#(<= main_~i~0 11)} is VALID [2022-04-28 03:08:36,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {149738#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149739#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:36,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {149739#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149739#(<= main_~i~0 12)} is VALID [2022-04-28 03:08:36,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {149739#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149740#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:36,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {149740#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149740#(<= main_~i~0 13)} is VALID [2022-04-28 03:08:36,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {149740#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149741#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:36,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {149741#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149741#(<= main_~i~0 14)} is VALID [2022-04-28 03:08:36,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {149741#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149742#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:36,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {149742#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149742#(<= main_~i~0 15)} is VALID [2022-04-28 03:08:36,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {149742#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149743#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:36,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {149743#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149743#(<= main_~i~0 16)} is VALID [2022-04-28 03:08:36,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {149743#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149744#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:36,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {149744#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149744#(<= main_~i~0 17)} is VALID [2022-04-28 03:08:36,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {149744#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149745#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:36,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {149745#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149745#(<= main_~i~0 18)} is VALID [2022-04-28 03:08:36,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {149745#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149746#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:36,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {149746#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149746#(<= main_~i~0 19)} is VALID [2022-04-28 03:08:36,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {149746#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149747#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:36,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {149747#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149747#(<= main_~i~0 20)} is VALID [2022-04-28 03:08:36,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {149747#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149748#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:36,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {149748#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149748#(<= main_~i~0 21)} is VALID [2022-04-28 03:08:36,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {149748#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149749#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:36,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {149749#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149749#(<= main_~i~0 22)} is VALID [2022-04-28 03:08:36,477 INFO L290 TraceCheckUtils]: 51: Hoare triple {149749#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149750#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:36,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {149750#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149750#(<= main_~i~0 23)} is VALID [2022-04-28 03:08:36,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {149750#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149751#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:36,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {149751#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149751#(<= main_~i~0 24)} is VALID [2022-04-28 03:08:36,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {149751#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149752#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:36,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {149752#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149752#(<= main_~i~0 25)} is VALID [2022-04-28 03:08:36,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {149752#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149753#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:36,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {149753#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149753#(<= main_~i~0 26)} is VALID [2022-04-28 03:08:36,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {149753#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149754#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:36,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {149754#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149754#(<= main_~i~0 27)} is VALID [2022-04-28 03:08:36,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {149754#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149755#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:36,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {149755#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149755#(<= main_~i~0 28)} is VALID [2022-04-28 03:08:36,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {149755#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149756#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:36,480 INFO L290 TraceCheckUtils]: 64: Hoare triple {149756#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149756#(<= main_~i~0 29)} is VALID [2022-04-28 03:08:36,480 INFO L290 TraceCheckUtils]: 65: Hoare triple {149756#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149757#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:36,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {149757#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149757#(<= main_~i~0 30)} is VALID [2022-04-28 03:08:36,480 INFO L290 TraceCheckUtils]: 67: Hoare triple {149757#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149758#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:36,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {149758#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149758#(<= main_~i~0 31)} is VALID [2022-04-28 03:08:36,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {149758#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149759#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:36,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {149759#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149759#(<= main_~i~0 32)} is VALID [2022-04-28 03:08:36,481 INFO L290 TraceCheckUtils]: 71: Hoare triple {149759#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149760#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:36,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {149760#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149760#(<= main_~i~0 33)} is VALID [2022-04-28 03:08:36,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {149760#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149761#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:36,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {149761#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149761#(<= main_~i~0 34)} is VALID [2022-04-28 03:08:36,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {149761#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149762#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:36,482 INFO L290 TraceCheckUtils]: 76: Hoare triple {149762#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149762#(<= main_~i~0 35)} is VALID [2022-04-28 03:08:36,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {149762#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149763#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:36,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {149763#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149763#(<= main_~i~0 36)} is VALID [2022-04-28 03:08:36,483 INFO L290 TraceCheckUtils]: 79: Hoare triple {149763#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149764#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:36,483 INFO L290 TraceCheckUtils]: 80: Hoare triple {149764#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149764#(<= main_~i~0 37)} is VALID [2022-04-28 03:08:36,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {149764#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149765#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:36,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {149765#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149765#(<= main_~i~0 38)} is VALID [2022-04-28 03:08:36,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {149765#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149766#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:36,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {149766#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149766#(<= main_~i~0 39)} is VALID [2022-04-28 03:08:36,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {149766#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149767#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:36,485 INFO L290 TraceCheckUtils]: 86: Hoare triple {149767#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149767#(<= main_~i~0 40)} is VALID [2022-04-28 03:08:36,485 INFO L290 TraceCheckUtils]: 87: Hoare triple {149767#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149768#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:36,485 INFO L290 TraceCheckUtils]: 88: Hoare triple {149768#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149768#(<= main_~i~0 41)} is VALID [2022-04-28 03:08:36,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {149768#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149769#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:36,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {149769#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149769#(<= main_~i~0 42)} is VALID [2022-04-28 03:08:36,486 INFO L290 TraceCheckUtils]: 91: Hoare triple {149769#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149770#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:36,486 INFO L290 TraceCheckUtils]: 92: Hoare triple {149770#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149770#(<= main_~i~0 43)} is VALID [2022-04-28 03:08:36,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {149770#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149771#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:36,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {149771#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149771#(<= main_~i~0 44)} is VALID [2022-04-28 03:08:36,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {149771#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149772#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:36,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {149772#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149772#(<= main_~i~0 45)} is VALID [2022-04-28 03:08:36,487 INFO L290 TraceCheckUtils]: 97: Hoare triple {149772#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149773#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:36,487 INFO L290 TraceCheckUtils]: 98: Hoare triple {149773#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149773#(<= main_~i~0 46)} is VALID [2022-04-28 03:08:36,488 INFO L290 TraceCheckUtils]: 99: Hoare triple {149773#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149774#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:36,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {149774#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149774#(<= main_~i~0 47)} is VALID [2022-04-28 03:08:36,488 INFO L290 TraceCheckUtils]: 101: Hoare triple {149774#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149775#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:36,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {149775#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149775#(<= main_~i~0 48)} is VALID [2022-04-28 03:08:36,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {149775#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149776#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:36,489 INFO L290 TraceCheckUtils]: 104: Hoare triple {149776#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149776#(<= main_~i~0 49)} is VALID [2022-04-28 03:08:36,489 INFO L290 TraceCheckUtils]: 105: Hoare triple {149776#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149777#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:36,489 INFO L290 TraceCheckUtils]: 106: Hoare triple {149777#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149777#(<= main_~i~0 50)} is VALID [2022-04-28 03:08:36,489 INFO L290 TraceCheckUtils]: 107: Hoare triple {149777#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149778#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:36,490 INFO L290 TraceCheckUtils]: 108: Hoare triple {149778#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149778#(<= main_~i~0 51)} is VALID [2022-04-28 03:08:36,490 INFO L290 TraceCheckUtils]: 109: Hoare triple {149778#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149779#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:36,490 INFO L290 TraceCheckUtils]: 110: Hoare triple {149779#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149779#(<= main_~i~0 52)} is VALID [2022-04-28 03:08:36,490 INFO L290 TraceCheckUtils]: 111: Hoare triple {149779#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149780#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:36,490 INFO L290 TraceCheckUtils]: 112: Hoare triple {149780#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149780#(<= main_~i~0 53)} is VALID [2022-04-28 03:08:36,491 INFO L290 TraceCheckUtils]: 113: Hoare triple {149780#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149781#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:36,491 INFO L290 TraceCheckUtils]: 114: Hoare triple {149781#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149781#(<= main_~i~0 54)} is VALID [2022-04-28 03:08:36,491 INFO L290 TraceCheckUtils]: 115: Hoare triple {149781#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149782#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:36,491 INFO L290 TraceCheckUtils]: 116: Hoare triple {149782#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149782#(<= main_~i~0 55)} is VALID [2022-04-28 03:08:36,492 INFO L290 TraceCheckUtils]: 117: Hoare triple {149782#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149783#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:36,492 INFO L290 TraceCheckUtils]: 118: Hoare triple {149783#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149783#(<= main_~i~0 56)} is VALID [2022-04-28 03:08:36,492 INFO L290 TraceCheckUtils]: 119: Hoare triple {149783#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149784#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:36,492 INFO L290 TraceCheckUtils]: 120: Hoare triple {149784#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149784#(<= main_~i~0 57)} is VALID [2022-04-28 03:08:36,492 INFO L290 TraceCheckUtils]: 121: Hoare triple {149784#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149785#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:36,493 INFO L290 TraceCheckUtils]: 122: Hoare triple {149785#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149785#(<= main_~i~0 58)} is VALID [2022-04-28 03:08:36,493 INFO L290 TraceCheckUtils]: 123: Hoare triple {149785#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149786#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:36,493 INFO L290 TraceCheckUtils]: 124: Hoare triple {149786#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149786#(<= main_~i~0 59)} is VALID [2022-04-28 03:08:36,493 INFO L290 TraceCheckUtils]: 125: Hoare triple {149786#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149787#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:36,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {149787#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149787#(<= main_~i~0 60)} is VALID [2022-04-28 03:08:36,494 INFO L290 TraceCheckUtils]: 127: Hoare triple {149787#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149788#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:36,494 INFO L290 TraceCheckUtils]: 128: Hoare triple {149788#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149788#(<= main_~i~0 61)} is VALID [2022-04-28 03:08:36,494 INFO L290 TraceCheckUtils]: 129: Hoare triple {149788#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149789#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:36,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {149789#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149789#(<= main_~i~0 62)} is VALID [2022-04-28 03:08:36,495 INFO L290 TraceCheckUtils]: 131: Hoare triple {149789#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149790#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:36,495 INFO L290 TraceCheckUtils]: 132: Hoare triple {149790#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149790#(<= main_~i~0 63)} is VALID [2022-04-28 03:08:36,495 INFO L290 TraceCheckUtils]: 133: Hoare triple {149790#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149791#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:36,495 INFO L290 TraceCheckUtils]: 134: Hoare triple {149791#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149791#(<= main_~i~0 64)} is VALID [2022-04-28 03:08:36,496 INFO L290 TraceCheckUtils]: 135: Hoare triple {149791#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149792#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:36,496 INFO L290 TraceCheckUtils]: 136: Hoare triple {149792#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149792#(<= main_~i~0 65)} is VALID [2022-04-28 03:08:36,496 INFO L290 TraceCheckUtils]: 137: Hoare triple {149792#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149793#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:36,496 INFO L290 TraceCheckUtils]: 138: Hoare triple {149793#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149793#(<= main_~i~0 66)} is VALID [2022-04-28 03:08:36,497 INFO L290 TraceCheckUtils]: 139: Hoare triple {149793#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149794#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:36,497 INFO L290 TraceCheckUtils]: 140: Hoare triple {149794#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149794#(<= main_~i~0 67)} is VALID [2022-04-28 03:08:36,497 INFO L290 TraceCheckUtils]: 141: Hoare triple {149794#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149795#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:36,497 INFO L290 TraceCheckUtils]: 142: Hoare triple {149795#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149795#(<= main_~i~0 68)} is VALID [2022-04-28 03:08:36,497 INFO L290 TraceCheckUtils]: 143: Hoare triple {149795#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149796#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:36,498 INFO L290 TraceCheckUtils]: 144: Hoare triple {149796#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149796#(<= main_~i~0 69)} is VALID [2022-04-28 03:08:36,498 INFO L290 TraceCheckUtils]: 145: Hoare triple {149796#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149797#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:36,498 INFO L290 TraceCheckUtils]: 146: Hoare triple {149797#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149797#(<= main_~i~0 70)} is VALID [2022-04-28 03:08:36,498 INFO L290 TraceCheckUtils]: 147: Hoare triple {149797#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149798#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:36,498 INFO L290 TraceCheckUtils]: 148: Hoare triple {149798#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149798#(<= main_~i~0 71)} is VALID [2022-04-28 03:08:36,499 INFO L290 TraceCheckUtils]: 149: Hoare triple {149798#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149799#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:36,499 INFO L290 TraceCheckUtils]: 150: Hoare triple {149799#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {149799#(<= main_~i~0 72)} is VALID [2022-04-28 03:08:36,499 INFO L290 TraceCheckUtils]: 151: Hoare triple {149799#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {149800#(<= main_~i~0 73)} is VALID [2022-04-28 03:08:36,499 INFO L290 TraceCheckUtils]: 152: Hoare triple {149800#(<= main_~i~0 73)} assume !(~i~0 < 1024); {149723#false} is VALID [2022-04-28 03:08:36,499 INFO L290 TraceCheckUtils]: 153: Hoare triple {149723#false} ~i~0 := 0; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 154: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 155: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 156: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 157: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 158: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 159: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 160: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 161: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 162: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 163: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 164: Hoare triple {149723#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L272 TraceCheckUtils]: 165: Hoare triple {149723#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 166: Hoare triple {149723#false} ~cond := #in~cond; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 167: Hoare triple {149723#false} assume 0 == ~cond; {149723#false} is VALID [2022-04-28 03:08:36,500 INFO L290 TraceCheckUtils]: 168: Hoare triple {149723#false} assume !false; {149723#false} is VALID [2022-04-28 03:08:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5339 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:36,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 168: Hoare triple {149723#false} assume !false; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 167: Hoare triple {149723#false} assume 0 == ~cond; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 166: Hoare triple {149723#false} ~cond := #in~cond; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L272 TraceCheckUtils]: 165: Hoare triple {149723#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 164: Hoare triple {149723#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 163: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 162: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 161: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:40,345 INFO L290 TraceCheckUtils]: 160: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 159: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 158: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 157: Hoare triple {149723#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 156: Hoare triple {149723#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 155: Hoare triple {149723#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 154: Hoare triple {149723#false} #t~short5 := ~i~0 < 1024; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 153: Hoare triple {149723#false} ~i~0 := 0; {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 152: Hoare triple {150358#(< main_~i~0 1024)} assume !(~i~0 < 1024); {149723#false} is VALID [2022-04-28 03:08:40,346 INFO L290 TraceCheckUtils]: 151: Hoare triple {150362#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150358#(< main_~i~0 1024)} is VALID [2022-04-28 03:08:40,347 INFO L290 TraceCheckUtils]: 150: Hoare triple {150362#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150362#(< main_~i~0 1023)} is VALID [2022-04-28 03:08:40,347 INFO L290 TraceCheckUtils]: 149: Hoare triple {150369#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150362#(< main_~i~0 1023)} is VALID [2022-04-28 03:08:40,347 INFO L290 TraceCheckUtils]: 148: Hoare triple {150369#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150369#(< main_~i~0 1022)} is VALID [2022-04-28 03:08:40,347 INFO L290 TraceCheckUtils]: 147: Hoare triple {150376#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150369#(< main_~i~0 1022)} is VALID [2022-04-28 03:08:40,348 INFO L290 TraceCheckUtils]: 146: Hoare triple {150376#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150376#(< main_~i~0 1021)} is VALID [2022-04-28 03:08:40,348 INFO L290 TraceCheckUtils]: 145: Hoare triple {150383#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150376#(< main_~i~0 1021)} is VALID [2022-04-28 03:08:40,348 INFO L290 TraceCheckUtils]: 144: Hoare triple {150383#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150383#(< main_~i~0 1020)} is VALID [2022-04-28 03:08:40,348 INFO L290 TraceCheckUtils]: 143: Hoare triple {150390#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150383#(< main_~i~0 1020)} is VALID [2022-04-28 03:08:40,348 INFO L290 TraceCheckUtils]: 142: Hoare triple {150390#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150390#(< main_~i~0 1019)} is VALID [2022-04-28 03:08:40,349 INFO L290 TraceCheckUtils]: 141: Hoare triple {150397#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150390#(< main_~i~0 1019)} is VALID [2022-04-28 03:08:40,349 INFO L290 TraceCheckUtils]: 140: Hoare triple {150397#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150397#(< main_~i~0 1018)} is VALID [2022-04-28 03:08:40,349 INFO L290 TraceCheckUtils]: 139: Hoare triple {150404#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150397#(< main_~i~0 1018)} is VALID [2022-04-28 03:08:40,349 INFO L290 TraceCheckUtils]: 138: Hoare triple {150404#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150404#(< main_~i~0 1017)} is VALID [2022-04-28 03:08:40,350 INFO L290 TraceCheckUtils]: 137: Hoare triple {150411#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150404#(< main_~i~0 1017)} is VALID [2022-04-28 03:08:40,350 INFO L290 TraceCheckUtils]: 136: Hoare triple {150411#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150411#(< main_~i~0 1016)} is VALID [2022-04-28 03:08:40,350 INFO L290 TraceCheckUtils]: 135: Hoare triple {150418#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150411#(< main_~i~0 1016)} is VALID [2022-04-28 03:08:40,350 INFO L290 TraceCheckUtils]: 134: Hoare triple {150418#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150418#(< main_~i~0 1015)} is VALID [2022-04-28 03:08:40,351 INFO L290 TraceCheckUtils]: 133: Hoare triple {150425#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150418#(< main_~i~0 1015)} is VALID [2022-04-28 03:08:40,351 INFO L290 TraceCheckUtils]: 132: Hoare triple {150425#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150425#(< main_~i~0 1014)} is VALID [2022-04-28 03:08:40,351 INFO L290 TraceCheckUtils]: 131: Hoare triple {150432#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150425#(< main_~i~0 1014)} is VALID [2022-04-28 03:08:40,351 INFO L290 TraceCheckUtils]: 130: Hoare triple {150432#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150432#(< main_~i~0 1013)} is VALID [2022-04-28 03:08:40,351 INFO L290 TraceCheckUtils]: 129: Hoare triple {150439#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150432#(< main_~i~0 1013)} is VALID [2022-04-28 03:08:40,352 INFO L290 TraceCheckUtils]: 128: Hoare triple {150439#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150439#(< main_~i~0 1012)} is VALID [2022-04-28 03:08:40,352 INFO L290 TraceCheckUtils]: 127: Hoare triple {150446#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150439#(< main_~i~0 1012)} is VALID [2022-04-28 03:08:40,352 INFO L290 TraceCheckUtils]: 126: Hoare triple {150446#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150446#(< main_~i~0 1011)} is VALID [2022-04-28 03:08:40,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {150453#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150446#(< main_~i~0 1011)} is VALID [2022-04-28 03:08:40,353 INFO L290 TraceCheckUtils]: 124: Hoare triple {150453#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150453#(< main_~i~0 1010)} is VALID [2022-04-28 03:08:40,353 INFO L290 TraceCheckUtils]: 123: Hoare triple {150460#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150453#(< main_~i~0 1010)} is VALID [2022-04-28 03:08:40,353 INFO L290 TraceCheckUtils]: 122: Hoare triple {150460#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150460#(< main_~i~0 1009)} is VALID [2022-04-28 03:08:40,353 INFO L290 TraceCheckUtils]: 121: Hoare triple {150467#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150460#(< main_~i~0 1009)} is VALID [2022-04-28 03:08:40,353 INFO L290 TraceCheckUtils]: 120: Hoare triple {150467#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150467#(< main_~i~0 1008)} is VALID [2022-04-28 03:08:40,354 INFO L290 TraceCheckUtils]: 119: Hoare triple {150474#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150467#(< main_~i~0 1008)} is VALID [2022-04-28 03:08:40,354 INFO L290 TraceCheckUtils]: 118: Hoare triple {150474#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150474#(< main_~i~0 1007)} is VALID [2022-04-28 03:08:40,354 INFO L290 TraceCheckUtils]: 117: Hoare triple {150481#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150474#(< main_~i~0 1007)} is VALID [2022-04-28 03:08:40,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {150481#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150481#(< main_~i~0 1006)} is VALID [2022-04-28 03:08:40,355 INFO L290 TraceCheckUtils]: 115: Hoare triple {150488#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150481#(< main_~i~0 1006)} is VALID [2022-04-28 03:08:40,355 INFO L290 TraceCheckUtils]: 114: Hoare triple {150488#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150488#(< main_~i~0 1005)} is VALID [2022-04-28 03:08:40,355 INFO L290 TraceCheckUtils]: 113: Hoare triple {150495#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150488#(< main_~i~0 1005)} is VALID [2022-04-28 03:08:40,355 INFO L290 TraceCheckUtils]: 112: Hoare triple {150495#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150495#(< main_~i~0 1004)} is VALID [2022-04-28 03:08:40,356 INFO L290 TraceCheckUtils]: 111: Hoare triple {150502#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150495#(< main_~i~0 1004)} is VALID [2022-04-28 03:08:40,356 INFO L290 TraceCheckUtils]: 110: Hoare triple {150502#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150502#(< main_~i~0 1003)} is VALID [2022-04-28 03:08:40,356 INFO L290 TraceCheckUtils]: 109: Hoare triple {150509#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150502#(< main_~i~0 1003)} is VALID [2022-04-28 03:08:40,356 INFO L290 TraceCheckUtils]: 108: Hoare triple {150509#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150509#(< main_~i~0 1002)} is VALID [2022-04-28 03:08:40,356 INFO L290 TraceCheckUtils]: 107: Hoare triple {150516#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150509#(< main_~i~0 1002)} is VALID [2022-04-28 03:08:40,357 INFO L290 TraceCheckUtils]: 106: Hoare triple {150516#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150516#(< main_~i~0 1001)} is VALID [2022-04-28 03:08:40,357 INFO L290 TraceCheckUtils]: 105: Hoare triple {150523#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150516#(< main_~i~0 1001)} is VALID [2022-04-28 03:08:40,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {150523#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150523#(< main_~i~0 1000)} is VALID [2022-04-28 03:08:40,357 INFO L290 TraceCheckUtils]: 103: Hoare triple {150530#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150523#(< main_~i~0 1000)} is VALID [2022-04-28 03:08:40,358 INFO L290 TraceCheckUtils]: 102: Hoare triple {150530#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150530#(< main_~i~0 999)} is VALID [2022-04-28 03:08:40,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {150537#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150530#(< main_~i~0 999)} is VALID [2022-04-28 03:08:40,358 INFO L290 TraceCheckUtils]: 100: Hoare triple {150537#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150537#(< main_~i~0 998)} is VALID [2022-04-28 03:08:40,358 INFO L290 TraceCheckUtils]: 99: Hoare triple {150544#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150537#(< main_~i~0 998)} is VALID [2022-04-28 03:08:40,358 INFO L290 TraceCheckUtils]: 98: Hoare triple {150544#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150544#(< main_~i~0 997)} is VALID [2022-04-28 03:08:40,359 INFO L290 TraceCheckUtils]: 97: Hoare triple {150551#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150544#(< main_~i~0 997)} is VALID [2022-04-28 03:08:40,359 INFO L290 TraceCheckUtils]: 96: Hoare triple {150551#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150551#(< main_~i~0 996)} is VALID [2022-04-28 03:08:40,359 INFO L290 TraceCheckUtils]: 95: Hoare triple {150558#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150551#(< main_~i~0 996)} is VALID [2022-04-28 03:08:40,359 INFO L290 TraceCheckUtils]: 94: Hoare triple {150558#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150558#(< main_~i~0 995)} is VALID [2022-04-28 03:08:40,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {150565#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150558#(< main_~i~0 995)} is VALID [2022-04-28 03:08:40,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {150565#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150565#(< main_~i~0 994)} is VALID [2022-04-28 03:08:40,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {150572#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150565#(< main_~i~0 994)} is VALID [2022-04-28 03:08:40,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {150572#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150572#(< main_~i~0 993)} is VALID [2022-04-28 03:08:40,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {150579#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150572#(< main_~i~0 993)} is VALID [2022-04-28 03:08:40,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {150579#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150579#(< main_~i~0 992)} is VALID [2022-04-28 03:08:40,361 INFO L290 TraceCheckUtils]: 87: Hoare triple {150586#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150579#(< main_~i~0 992)} is VALID [2022-04-28 03:08:40,361 INFO L290 TraceCheckUtils]: 86: Hoare triple {150586#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150586#(< main_~i~0 991)} is VALID [2022-04-28 03:08:40,361 INFO L290 TraceCheckUtils]: 85: Hoare triple {150593#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150586#(< main_~i~0 991)} is VALID [2022-04-28 03:08:40,362 INFO L290 TraceCheckUtils]: 84: Hoare triple {150593#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150593#(< main_~i~0 990)} is VALID [2022-04-28 03:08:40,362 INFO L290 TraceCheckUtils]: 83: Hoare triple {150600#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150593#(< main_~i~0 990)} is VALID [2022-04-28 03:08:40,362 INFO L290 TraceCheckUtils]: 82: Hoare triple {150600#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150600#(< main_~i~0 989)} is VALID [2022-04-28 03:08:40,362 INFO L290 TraceCheckUtils]: 81: Hoare triple {150607#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150600#(< main_~i~0 989)} is VALID [2022-04-28 03:08:40,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {150607#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150607#(< main_~i~0 988)} is VALID [2022-04-28 03:08:40,363 INFO L290 TraceCheckUtils]: 79: Hoare triple {150614#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150607#(< main_~i~0 988)} is VALID [2022-04-28 03:08:40,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {150614#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150614#(< main_~i~0 987)} is VALID [2022-04-28 03:08:40,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {150621#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150614#(< main_~i~0 987)} is VALID [2022-04-28 03:08:40,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {150621#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150621#(< main_~i~0 986)} is VALID [2022-04-28 03:08:40,364 INFO L290 TraceCheckUtils]: 75: Hoare triple {150628#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150621#(< main_~i~0 986)} is VALID [2022-04-28 03:08:40,364 INFO L290 TraceCheckUtils]: 74: Hoare triple {150628#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150628#(< main_~i~0 985)} is VALID [2022-04-28 03:08:40,364 INFO L290 TraceCheckUtils]: 73: Hoare triple {150635#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150628#(< main_~i~0 985)} is VALID [2022-04-28 03:08:40,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {150635#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150635#(< main_~i~0 984)} is VALID [2022-04-28 03:08:40,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {150642#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150635#(< main_~i~0 984)} is VALID [2022-04-28 03:08:40,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {150642#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150642#(< main_~i~0 983)} is VALID [2022-04-28 03:08:40,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {150649#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150642#(< main_~i~0 983)} is VALID [2022-04-28 03:08:40,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {150649#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150649#(< main_~i~0 982)} is VALID [2022-04-28 03:08:40,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {150656#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150649#(< main_~i~0 982)} is VALID [2022-04-28 03:08:40,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {150656#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150656#(< main_~i~0 981)} is VALID [2022-04-28 03:08:40,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {150663#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150656#(< main_~i~0 981)} is VALID [2022-04-28 03:08:40,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {150663#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150663#(< main_~i~0 980)} is VALID [2022-04-28 03:08:40,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {150670#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150663#(< main_~i~0 980)} is VALID [2022-04-28 03:08:40,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {150670#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150670#(< main_~i~0 979)} is VALID [2022-04-28 03:08:40,367 INFO L290 TraceCheckUtils]: 61: Hoare triple {150677#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150670#(< main_~i~0 979)} is VALID [2022-04-28 03:08:40,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {150677#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150677#(< main_~i~0 978)} is VALID [2022-04-28 03:08:40,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {150684#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150677#(< main_~i~0 978)} is VALID [2022-04-28 03:08:40,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {150684#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150684#(< main_~i~0 977)} is VALID [2022-04-28 03:08:40,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {150691#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150684#(< main_~i~0 977)} is VALID [2022-04-28 03:08:40,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {150691#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150691#(< main_~i~0 976)} is VALID [2022-04-28 03:08:40,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {150698#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150691#(< main_~i~0 976)} is VALID [2022-04-28 03:08:40,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {150698#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150698#(< main_~i~0 975)} is VALID [2022-04-28 03:08:40,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {150705#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150698#(< main_~i~0 975)} is VALID [2022-04-28 03:08:40,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {150705#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150705#(< main_~i~0 974)} is VALID [2022-04-28 03:08:40,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {150712#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150705#(< main_~i~0 974)} is VALID [2022-04-28 03:08:40,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {150712#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150712#(< main_~i~0 973)} is VALID [2022-04-28 03:08:40,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {150719#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150712#(< main_~i~0 973)} is VALID [2022-04-28 03:08:40,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {150719#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150719#(< main_~i~0 972)} is VALID [2022-04-28 03:08:40,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {150726#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150719#(< main_~i~0 972)} is VALID [2022-04-28 03:08:40,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {150726#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150726#(< main_~i~0 971)} is VALID [2022-04-28 03:08:40,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {150733#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150726#(< main_~i~0 971)} is VALID [2022-04-28 03:08:40,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {150733#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150733#(< main_~i~0 970)} is VALID [2022-04-28 03:08:40,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {150740#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150733#(< main_~i~0 970)} is VALID [2022-04-28 03:08:40,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {150740#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150740#(< main_~i~0 969)} is VALID [2022-04-28 03:08:40,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {150747#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150740#(< main_~i~0 969)} is VALID [2022-04-28 03:08:40,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {150747#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150747#(< main_~i~0 968)} is VALID [2022-04-28 03:08:40,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {150754#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150747#(< main_~i~0 968)} is VALID [2022-04-28 03:08:40,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {150754#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150754#(< main_~i~0 967)} is VALID [2022-04-28 03:08:40,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {150761#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150754#(< main_~i~0 967)} is VALID [2022-04-28 03:08:40,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {150761#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150761#(< main_~i~0 966)} is VALID [2022-04-28 03:08:40,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {150768#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150761#(< main_~i~0 966)} is VALID [2022-04-28 03:08:40,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {150768#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150768#(< main_~i~0 965)} is VALID [2022-04-28 03:08:40,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {150775#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150768#(< main_~i~0 965)} is VALID [2022-04-28 03:08:40,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {150775#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150775#(< main_~i~0 964)} is VALID [2022-04-28 03:08:40,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {150782#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150775#(< main_~i~0 964)} is VALID [2022-04-28 03:08:40,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {150782#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150782#(< main_~i~0 963)} is VALID [2022-04-28 03:08:40,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {150789#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150782#(< main_~i~0 963)} is VALID [2022-04-28 03:08:40,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {150789#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150789#(< main_~i~0 962)} is VALID [2022-04-28 03:08:40,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {150796#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150789#(< main_~i~0 962)} is VALID [2022-04-28 03:08:40,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {150796#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150796#(< main_~i~0 961)} is VALID [2022-04-28 03:08:40,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {150803#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150796#(< main_~i~0 961)} is VALID [2022-04-28 03:08:40,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {150803#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150803#(< main_~i~0 960)} is VALID [2022-04-28 03:08:40,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {150810#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150803#(< main_~i~0 960)} is VALID [2022-04-28 03:08:40,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {150810#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150810#(< main_~i~0 959)} is VALID [2022-04-28 03:08:40,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {150817#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150810#(< main_~i~0 959)} is VALID [2022-04-28 03:08:40,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {150817#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150817#(< main_~i~0 958)} is VALID [2022-04-28 03:08:40,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {150824#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150817#(< main_~i~0 958)} is VALID [2022-04-28 03:08:40,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {150824#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150824#(< main_~i~0 957)} is VALID [2022-04-28 03:08:40,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {150831#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150824#(< main_~i~0 957)} is VALID [2022-04-28 03:08:40,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {150831#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150831#(< main_~i~0 956)} is VALID [2022-04-28 03:08:40,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {150838#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150831#(< main_~i~0 956)} is VALID [2022-04-28 03:08:40,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {150838#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150838#(< main_~i~0 955)} is VALID [2022-04-28 03:08:40,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {150845#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150838#(< main_~i~0 955)} is VALID [2022-04-28 03:08:40,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {150845#(< main_~i~0 954)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150845#(< main_~i~0 954)} is VALID [2022-04-28 03:08:40,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {150852#(< main_~i~0 953)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150845#(< main_~i~0 954)} is VALID [2022-04-28 03:08:40,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {150852#(< main_~i~0 953)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150852#(< main_~i~0 953)} is VALID [2022-04-28 03:08:40,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {150859#(< main_~i~0 952)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150852#(< main_~i~0 953)} is VALID [2022-04-28 03:08:40,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {150859#(< main_~i~0 952)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150859#(< main_~i~0 952)} is VALID [2022-04-28 03:08:40,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {150866#(< main_~i~0 951)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {150859#(< main_~i~0 952)} is VALID [2022-04-28 03:08:40,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {150866#(< main_~i~0 951)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {150866#(< main_~i~0 951)} is VALID [2022-04-28 03:08:40,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {149722#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {150866#(< main_~i~0 951)} is VALID [2022-04-28 03:08:40,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {149722#true} call #t~ret6 := main(); {149722#true} is VALID [2022-04-28 03:08:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149722#true} {149722#true} #64#return; {149722#true} is VALID [2022-04-28 03:08:40,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {149722#true} assume true; {149722#true} is VALID [2022-04-28 03:08:40,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {149722#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(12, 2); {149722#true} is VALID [2022-04-28 03:08:40,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {149722#true} call ULTIMATE.init(); {149722#true} is VALID [2022-04-28 03:08:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5339 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:08:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674431868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:40,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 76, 76] total 152 [2022-04-28 03:08:40,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097700400] [2022-04-28 03:08:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097700400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:40,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:40,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-28 03:08:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230077887] [2022-04-28 03:08:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 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 169 [2022-04-28 03:08:40,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:40,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:40,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:40,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-28 03:08:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-28 03:08:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11327, Invalid=11625, Unknown=0, NotChecked=0, Total=22952 [2022-04-28 03:08:40,450 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:02,711 INFO L93 Difference]: Finished difference Result 551 states and 703 transitions. [2022-04-28 03:09:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-28 03:09:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 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 169 [2022-04-28 03:09:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 694 transitions. [2022-04-28 03:09:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 694 transitions. [2022-04-28 03:09:02,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 694 transitions. [2022-04-28 03:09:03,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 694 edges. 694 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:03,154 INFO L225 Difference]: With dead ends: 551 [2022-04-28 03:09:03,154 INFO L226 Difference]: Without dead ends: 534 [2022-04-28 03:09:03,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3138 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=22502, Invalid=28348, Unknown=0, NotChecked=0, Total=50850 [2022-04-28 03:09:03,157 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1867 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:03,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 47 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:09:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-04-28 03:09:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 172. [2022-04-28 03:09:04,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:04,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 534 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,078 INFO L74 IsIncluded]: Start isIncluded. First operand 534 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,078 INFO L87 Difference]: Start difference. First operand 534 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:04,086 INFO L93 Difference]: Finished difference Result 534 states and 682 transitions. [2022-04-28 03:09:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 682 transitions. [2022-04-28 03:09:04,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:04,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:04,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 03:09:04,087 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 03:09:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:04,096 INFO L93 Difference]: Finished difference Result 534 states and 682 transitions. [2022-04-28 03:09:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 682 transitions. [2022-04-28 03:09:04,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:04,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:04,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:04,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2022-04-28 03:09:04,098 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 169 [2022-04-28 03:09:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:04,099 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2022-04-28 03:09:04,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.064935064935065) internal successors, (159), 76 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 176 transitions. [2022-04-28 03:09:04,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2022-04-28 03:09:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 03:09:04,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:04,627 INFO L195 NwaCegarLoop]: trace histogram [74, 74, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:04,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-04-28 03:09:04,832 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1346023017, now seen corresponding path program 149 times [2022-04-28 03:09:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:04,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145901904] [2022-04-28 03:09:04,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:09:04,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:09:04,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:09:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1346023017, now seen corresponding path program 150 times [2022-04-28 03:09:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118781773] [2022-04-28 03:09:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:06,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {153632#(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(12, 2); {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {153552#true} assume true; {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153552#true} {153552#true} #64#return; {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {153552#true} call ULTIMATE.init(); {153632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:06,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {153632#(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(12, 2); {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {153552#true} assume true; {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153552#true} {153552#true} #64#return; {153552#true} is VALID [2022-04-28 03:09:06,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {153552#true} call #t~ret6 := main(); {153552#true} is VALID [2022-04-28 03:09:06,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {153552#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {153557#(= main_~i~0 0)} is VALID [2022-04-28 03:09:06,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {153557#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153557#(= main_~i~0 0)} is VALID [2022-04-28 03:09:06,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {153557#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:06,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {153558#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:06,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {153558#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:06,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {153559#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:06,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {153559#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153560#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:06,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {153560#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153560#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:06,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {153560#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153561#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:06,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {153561#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153561#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:06,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {153561#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153562#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:06,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {153562#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153562#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:06,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {153562#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153563#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:06,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {153563#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153563#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:06,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {153563#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153564#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:06,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {153564#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153564#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:06,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {153564#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153565#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:06,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {153565#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153565#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:06,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {153565#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153566#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:06,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {153566#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153566#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:06,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {153566#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153567#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:06,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {153567#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153567#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:06,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {153567#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153568#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:06,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {153568#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153568#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:06,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {153568#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153569#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:06,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {153569#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153569#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:06,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {153569#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153570#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:06,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {153570#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153570#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:06,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {153570#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153571#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:06,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {153571#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153571#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:06,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {153571#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153572#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:06,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {153572#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153572#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:06,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {153572#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153573#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:06,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {153573#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153573#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:06,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {153573#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153574#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:06,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {153574#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153574#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:06,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {153574#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153575#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:06,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {153575#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153575#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:06,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {153575#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153576#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:06,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {153576#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153576#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:06,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {153576#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153577#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:06,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {153577#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153577#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:06,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {153577#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153578#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:06,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {153578#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153578#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:06,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {153578#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153579#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:06,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {153579#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153579#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:06,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {153579#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153580#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:06,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {153580#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153580#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:06,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {153580#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153581#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:06,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {153581#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153581#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:06,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {153581#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153582#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:06,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {153582#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153582#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:06,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {153582#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153583#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:06,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {153583#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153583#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:06,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {153583#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153584#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:06,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {153584#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153584#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:06,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {153584#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153585#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:06,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {153585#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153585#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:06,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {153585#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153586#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:06,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {153586#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153586#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:06,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {153586#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153587#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:06,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {153587#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153587#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:06,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {153587#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153588#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:06,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {153588#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153588#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:06,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {153588#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153589#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:06,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {153589#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153589#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:06,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {153589#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153590#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:06,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {153590#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153590#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:06,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {153590#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153591#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:06,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {153591#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153591#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:06,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {153591#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153592#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:06,281 INFO L290 TraceCheckUtils]: 76: Hoare triple {153592#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153592#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:06,281 INFO L290 TraceCheckUtils]: 77: Hoare triple {153592#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153593#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:06,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {153593#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153593#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:06,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {153593#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153594#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:06,282 INFO L290 TraceCheckUtils]: 80: Hoare triple {153594#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153594#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:06,282 INFO L290 TraceCheckUtils]: 81: Hoare triple {153594#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153595#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:06,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {153595#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153595#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:06,283 INFO L290 TraceCheckUtils]: 83: Hoare triple {153595#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153596#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:06,283 INFO L290 TraceCheckUtils]: 84: Hoare triple {153596#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153596#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:06,283 INFO L290 TraceCheckUtils]: 85: Hoare triple {153596#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153597#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:06,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {153597#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153597#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:06,284 INFO L290 TraceCheckUtils]: 87: Hoare triple {153597#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153598#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:06,284 INFO L290 TraceCheckUtils]: 88: Hoare triple {153598#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153598#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:06,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {153598#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153599#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:06,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {153599#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153599#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:06,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {153599#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153600#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:06,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {153600#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153600#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:06,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {153600#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153601#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:06,285 INFO L290 TraceCheckUtils]: 94: Hoare triple {153601#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153601#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:06,285 INFO L290 TraceCheckUtils]: 95: Hoare triple {153601#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153602#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:06,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {153602#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153602#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:06,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {153602#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153603#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:06,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {153603#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153603#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:06,286 INFO L290 TraceCheckUtils]: 99: Hoare triple {153603#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153604#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:06,286 INFO L290 TraceCheckUtils]: 100: Hoare triple {153604#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153604#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:06,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {153604#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153605#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:06,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {153605#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153605#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:06,287 INFO L290 TraceCheckUtils]: 103: Hoare triple {153605#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153606#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:06,287 INFO L290 TraceCheckUtils]: 104: Hoare triple {153606#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153606#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:06,288 INFO L290 TraceCheckUtils]: 105: Hoare triple {153606#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153607#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:06,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {153607#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153607#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:06,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {153607#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153608#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:06,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {153608#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153608#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:06,288 INFO L290 TraceCheckUtils]: 109: Hoare triple {153608#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153609#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:06,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {153609#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153609#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:06,289 INFO L290 TraceCheckUtils]: 111: Hoare triple {153609#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153610#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:06,289 INFO L290 TraceCheckUtils]: 112: Hoare triple {153610#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153610#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:06,289 INFO L290 TraceCheckUtils]: 113: Hoare triple {153610#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153611#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:06,290 INFO L290 TraceCheckUtils]: 114: Hoare triple {153611#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153611#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:06,290 INFO L290 TraceCheckUtils]: 115: Hoare triple {153611#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153612#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:06,290 INFO L290 TraceCheckUtils]: 116: Hoare triple {153612#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153612#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:06,290 INFO L290 TraceCheckUtils]: 117: Hoare triple {153612#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153613#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:06,290 INFO L290 TraceCheckUtils]: 118: Hoare triple {153613#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153613#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:06,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {153613#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153614#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:06,291 INFO L290 TraceCheckUtils]: 120: Hoare triple {153614#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153614#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:06,291 INFO L290 TraceCheckUtils]: 121: Hoare triple {153614#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153615#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:06,291 INFO L290 TraceCheckUtils]: 122: Hoare triple {153615#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153615#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:06,292 INFO L290 TraceCheckUtils]: 123: Hoare triple {153615#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153616#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:06,292 INFO L290 TraceCheckUtils]: 124: Hoare triple {153616#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153616#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:06,292 INFO L290 TraceCheckUtils]: 125: Hoare triple {153616#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153617#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:06,292 INFO L290 TraceCheckUtils]: 126: Hoare triple {153617#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153617#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:06,292 INFO L290 TraceCheckUtils]: 127: Hoare triple {153617#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153618#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:06,293 INFO L290 TraceCheckUtils]: 128: Hoare triple {153618#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153618#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:06,293 INFO L290 TraceCheckUtils]: 129: Hoare triple {153618#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153619#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:06,293 INFO L290 TraceCheckUtils]: 130: Hoare triple {153619#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153619#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:06,293 INFO L290 TraceCheckUtils]: 131: Hoare triple {153619#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153620#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:06,293 INFO L290 TraceCheckUtils]: 132: Hoare triple {153620#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153620#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:06,294 INFO L290 TraceCheckUtils]: 133: Hoare triple {153620#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153621#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:06,294 INFO L290 TraceCheckUtils]: 134: Hoare triple {153621#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153621#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:06,294 INFO L290 TraceCheckUtils]: 135: Hoare triple {153621#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153622#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:06,294 INFO L290 TraceCheckUtils]: 136: Hoare triple {153622#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153622#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:06,295 INFO L290 TraceCheckUtils]: 137: Hoare triple {153622#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153623#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:06,295 INFO L290 TraceCheckUtils]: 138: Hoare triple {153623#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153623#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:06,295 INFO L290 TraceCheckUtils]: 139: Hoare triple {153623#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153624#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:06,295 INFO L290 TraceCheckUtils]: 140: Hoare triple {153624#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153624#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:06,295 INFO L290 TraceCheckUtils]: 141: Hoare triple {153624#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153625#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:06,296 INFO L290 TraceCheckUtils]: 142: Hoare triple {153625#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153625#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:06,296 INFO L290 TraceCheckUtils]: 143: Hoare triple {153625#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153626#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:06,296 INFO L290 TraceCheckUtils]: 144: Hoare triple {153626#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153626#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:06,296 INFO L290 TraceCheckUtils]: 145: Hoare triple {153626#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153627#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:06,297 INFO L290 TraceCheckUtils]: 146: Hoare triple {153627#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153627#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:06,297 INFO L290 TraceCheckUtils]: 147: Hoare triple {153627#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153628#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:06,297 INFO L290 TraceCheckUtils]: 148: Hoare triple {153628#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153628#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:06,297 INFO L290 TraceCheckUtils]: 149: Hoare triple {153628#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153629#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:06,297 INFO L290 TraceCheckUtils]: 150: Hoare triple {153629#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153629#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 151: Hoare triple {153629#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153630#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 152: Hoare triple {153630#(<= main_~i~0 73)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153630#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {153630#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153631#(<= main_~i~0 74)} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 154: Hoare triple {153631#(<= main_~i~0 74)} assume !(~i~0 < 1024); {153553#false} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 155: Hoare triple {153553#false} ~i~0 := 0; {153553#false} is VALID [2022-04-28 03:09:06,298 INFO L290 TraceCheckUtils]: 156: Hoare triple {153553#false} #t~short5 := ~i~0 < 1024; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 157: Hoare triple {153553#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 158: Hoare triple {153553#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 159: Hoare triple {153553#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 160: Hoare triple {153553#false} #t~short5 := ~i~0 < 1024; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 161: Hoare triple {153553#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 162: Hoare triple {153553#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 163: Hoare triple {153553#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 164: Hoare triple {153553#false} #t~short5 := ~i~0 < 1024; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 165: Hoare triple {153553#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 166: Hoare triple {153553#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L272 TraceCheckUtils]: 167: Hoare triple {153553#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 168: Hoare triple {153553#false} ~cond := #in~cond; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 169: Hoare triple {153553#false} assume 0 == ~cond; {153553#false} is VALID [2022-04-28 03:09:06,299 INFO L290 TraceCheckUtils]: 170: Hoare triple {153553#false} assume !false; {153553#false} is VALID [2022-04-28 03:09:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5486 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:09:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118781773] [2022-04-28 03:09:06,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118781773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523642560] [2022-04-28 03:09:06,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:09:06,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:06,302 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:06,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-28 03:09:06,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:09:06,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:06,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:09:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:07,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {153552#true} call ULTIMATE.init(); {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {153552#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(12, 2); {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {153552#true} assume true; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153552#true} {153552#true} #64#return; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {153552#true} call #t~ret6 := main(); {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {153552#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 63: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 95: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 96: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 97: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 100: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 101: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 102: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,144 INFO L290 TraceCheckUtils]: 103: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 104: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 106: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 107: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 108: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 109: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 110: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 111: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 112: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 113: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 114: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 115: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 116: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 117: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 118: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,145 INFO L290 TraceCheckUtils]: 119: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 120: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 121: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 122: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 123: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 124: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 125: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 126: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 127: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 128: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 129: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 130: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 131: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 132: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 133: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,146 INFO L290 TraceCheckUtils]: 134: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 135: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 136: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 137: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 138: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 139: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 140: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 141: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 142: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 143: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 144: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 145: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 146: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 147: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 148: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 149: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,147 INFO L290 TraceCheckUtils]: 150: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 151: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 152: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 153: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 154: Hoare triple {153552#true} assume !(~i~0 < 1024); {153552#true} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 155: Hoare triple {153552#true} ~i~0 := 0; {154101#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 156: Hoare triple {154101#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {154101#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:07,148 INFO L290 TraceCheckUtils]: 157: Hoare triple {154101#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {154101#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:07,149 INFO L290 TraceCheckUtils]: 158: Hoare triple {154101#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {154101#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:07,149 INFO L290 TraceCheckUtils]: 159: Hoare triple {154101#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:07,149 INFO L290 TraceCheckUtils]: 160: Hoare triple {153558#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:07,149 INFO L290 TraceCheckUtils]: 161: Hoare triple {153558#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:07,149 INFO L290 TraceCheckUtils]: 162: Hoare triple {153558#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {153558#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:07,150 INFO L290 TraceCheckUtils]: 163: Hoare triple {153558#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:07,150 INFO L290 TraceCheckUtils]: 164: Hoare triple {153559#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:07,150 INFO L290 TraceCheckUtils]: 165: Hoare triple {153559#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:07,150 INFO L290 TraceCheckUtils]: 166: Hoare triple {153559#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {153559#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:07,151 INFO L272 TraceCheckUtils]: 167: Hoare triple {153559#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {154138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:09:07,151 INFO L290 TraceCheckUtils]: 168: Hoare triple {154138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {154142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:09:07,151 INFO L290 TraceCheckUtils]: 169: Hoare triple {154142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153553#false} is VALID [2022-04-28 03:09:07,151 INFO L290 TraceCheckUtils]: 170: Hoare triple {153553#false} assume !false; {153553#false} is VALID [2022-04-28 03:09:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5486 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5476 trivial. 0 not checked. [2022-04-28 03:09:07,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:07,400 INFO L290 TraceCheckUtils]: 170: Hoare triple {153553#false} assume !false; {153553#false} is VALID [2022-04-28 03:09:07,400 INFO L290 TraceCheckUtils]: 169: Hoare triple {154142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153553#false} is VALID [2022-04-28 03:09:07,400 INFO L290 TraceCheckUtils]: 168: Hoare triple {154138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {154142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:09:07,400 INFO L272 TraceCheckUtils]: 167: Hoare triple {154158#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {154138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:09:07,401 INFO L290 TraceCheckUtils]: 166: Hoare triple {154158#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {154158#(<= main_~i~0 512)} is VALID [2022-04-28 03:09:07,401 INFO L290 TraceCheckUtils]: 165: Hoare triple {154158#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {154158#(<= main_~i~0 512)} is VALID [2022-04-28 03:09:07,401 INFO L290 TraceCheckUtils]: 164: Hoare triple {154158#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {154158#(<= main_~i~0 512)} is VALID [2022-04-28 03:09:07,401 INFO L290 TraceCheckUtils]: 163: Hoare triple {154171#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {154158#(<= main_~i~0 512)} is VALID [2022-04-28 03:09:07,402 INFO L290 TraceCheckUtils]: 162: Hoare triple {154171#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {154171#(<= main_~i~0 511)} is VALID [2022-04-28 03:09:07,402 INFO L290 TraceCheckUtils]: 161: Hoare triple {154171#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {154171#(<= main_~i~0 511)} is VALID [2022-04-28 03:09:07,402 INFO L290 TraceCheckUtils]: 160: Hoare triple {154171#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {154171#(<= main_~i~0 511)} is VALID [2022-04-28 03:09:07,402 INFO L290 TraceCheckUtils]: 159: Hoare triple {154184#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {154171#(<= main_~i~0 511)} is VALID [2022-04-28 03:09:07,402 INFO L290 TraceCheckUtils]: 158: Hoare triple {154184#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {154184#(<= main_~i~0 510)} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 157: Hoare triple {154184#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {154184#(<= main_~i~0 510)} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 156: Hoare triple {154184#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {154184#(<= main_~i~0 510)} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 155: Hoare triple {153552#true} ~i~0 := 0; {154184#(<= main_~i~0 510)} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 154: Hoare triple {153552#true} assume !(~i~0 < 1024); {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 153: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 152: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 151: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 150: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 149: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 148: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,403 INFO L290 TraceCheckUtils]: 147: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 146: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 145: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 144: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 143: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 142: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 141: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 140: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 139: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 138: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 137: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 136: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 135: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 134: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 133: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 132: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,404 INFO L290 TraceCheckUtils]: 131: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 130: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 129: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 128: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 127: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 126: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 125: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 124: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 123: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 122: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 121: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 120: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 119: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 118: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 117: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,405 INFO L290 TraceCheckUtils]: 116: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 115: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 114: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 113: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 112: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 111: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 110: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 109: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 108: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 107: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 106: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 105: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 104: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 103: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 102: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 101: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,406 INFO L290 TraceCheckUtils]: 100: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 96: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 95: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 94: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 90: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 89: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 88: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 79: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 67: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {153552#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {153552#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {153552#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {153552#true} call #t~ret6 := main(); {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153552#true} {153552#true} #64#return; {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {153552#true} assume true; {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {153552#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(12, 2); {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {153552#true} call ULTIMATE.init(); {153552#true} is VALID [2022-04-28 03:09:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5486 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5476 trivial. 0 not checked. [2022-04-28 03:09:07,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523642560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:07,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:07,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 7, 7] total 84 [2022-04-28 03:09:07,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145901904] [2022-04-28 03:09:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145901904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:07,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:07,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-04-28 03:09:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281980058] [2022-04-28 03:09:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 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 171 [2022-04-28 03:09:07,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:07,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:07,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-04-28 03:09:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-04-28 03:09:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3246, Invalid=3726, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 03:09:07,482 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:29,597 INFO L93 Difference]: Finished difference Result 558 states and 712 transitions. [2022-04-28 03:09:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-28 03:09:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 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 171 [2022-04-28 03:09:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 703 transitions. [2022-04-28 03:09:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 703 transitions. [2022-04-28 03:09:29,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 703 transitions. [2022-04-28 03:09:30,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 703 edges. 703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:30,021 INFO L225 Difference]: With dead ends: 558 [2022-04-28 03:09:30,021 INFO L226 Difference]: Without dead ends: 541 [2022-04-28 03:09:30,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3302 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9322, Invalid=15800, Unknown=0, NotChecked=0, Total=25122 [2022-04-28 03:09:30,023 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1983 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:30,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 42 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:09:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-04-28 03:09:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 174. [2022-04-28 03:09:31,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:31,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:31,325 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:31,325 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,333 INFO L93 Difference]: Finished difference Result 541 states and 691 transitions. [2022-04-28 03:09:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 691 transitions. [2022-04-28 03:09:31,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-28 03:09:31,334 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 541 states. [2022-04-28 03:09:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,342 INFO L93 Difference]: Finished difference Result 541 states and 691 transitions. [2022-04-28 03:09:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 691 transitions. [2022-04-28 03:09:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:31,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.029585798816568) internal successors, (174), 169 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 178 transitions. [2022-04-28 03:09:31,344 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 178 transitions. Word has length 171 [2022-04-28 03:09:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:31,344 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 178 transitions. [2022-04-28 03:09:31,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 77 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:31,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 178 transitions. [2022-04-28 03:09:31,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:09:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 03:09:31,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:31,907 INFO L195 NwaCegarLoop]: trace histogram [75, 75, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:31,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-28 03:09:32,123 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 128012167, now seen corresponding path program 151 times [2022-04-28 03:09:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58871527] [2022-04-28 03:09:32,129 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:09:32,129 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:09:32,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:09:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 128012167, now seen corresponding path program 152 times [2022-04-28 03:09:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:32,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594651877] [2022-04-28 03:09:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {157441#(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(12, 2); {157360#true} is VALID [2022-04-28 03:09:33,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {157360#true} assume true; {157360#true} is VALID [2022-04-28 03:09:33,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157360#true} {157360#true} #64#return; {157360#true} is VALID [2022-04-28 03:09:33,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {157360#true} call ULTIMATE.init(); {157441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:33,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {157441#(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(12, 2); {157360#true} is VALID [2022-04-28 03:09:33,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {157360#true} assume true; {157360#true} is VALID [2022-04-28 03:09:33,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157360#true} {157360#true} #64#return; {157360#true} is VALID [2022-04-28 03:09:33,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {157360#true} call #t~ret6 := main(); {157360#true} is VALID [2022-04-28 03:09:33,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {157360#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {157365#(= main_~i~0 0)} is VALID [2022-04-28 03:09:33,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {157365#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157365#(= main_~i~0 0)} is VALID [2022-04-28 03:09:33,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {157365#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157366#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:33,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {157366#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157366#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:33,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {157366#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157367#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:33,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {157367#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157367#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:33,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {157367#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157368#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:33,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {157368#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157368#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:33,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {157368#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157369#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:33,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {157369#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157369#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:33,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {157369#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157370#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:33,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {157370#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157370#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:33,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {157370#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157371#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:33,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {157371#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157371#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:33,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {157371#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157372#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:33,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {157372#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157372#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:33,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {157372#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157373#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:33,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {157373#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157373#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:33,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {157373#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157374#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:33,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {157374#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157374#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:33,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {157374#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157375#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:33,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {157375#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157375#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:33,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {157375#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157376#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:33,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {157376#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157376#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:33,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {157376#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157377#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:33,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {157377#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157377#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:33,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {157377#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157378#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:33,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {157378#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157378#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:33,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {157378#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157379#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:33,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {157379#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157379#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:33,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {157379#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157380#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:33,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {157380#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157380#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:33,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {157380#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157381#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:33,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {157381#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157381#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:33,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {157381#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157382#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:33,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {157382#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157382#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:33,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {157382#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157383#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:33,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {157383#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157383#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:33,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {157383#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157384#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:33,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {157384#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157384#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:33,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {157384#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157385#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:33,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {157385#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157385#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:33,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {157385#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157386#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:33,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {157386#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157386#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:33,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {157386#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157387#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:33,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {157387#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157387#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:33,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {157387#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157388#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:33,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {157388#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157388#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:33,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {157388#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157389#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:33,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {157389#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157389#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:33,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {157389#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157390#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:33,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {157390#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157390#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:33,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {157390#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157391#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:33,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {157391#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157391#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:33,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {157391#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157392#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:33,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {157392#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157392#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:33,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {157392#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157393#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:33,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {157393#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157393#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:33,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {157393#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157394#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:33,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {157394#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157394#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:33,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {157394#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157395#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:33,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {157395#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157395#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:33,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {157395#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157396#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:33,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {157396#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157396#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:33,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {157396#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157397#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:33,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {157397#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157397#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:33,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {157397#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157398#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:33,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {157398#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157398#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:33,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {157398#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157399#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:33,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {157399#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157399#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:33,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {157399#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157400#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:33,832 INFO L290 TraceCheckUtils]: 76: Hoare triple {157400#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157400#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:33,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {157400#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157401#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:33,833 INFO L290 TraceCheckUtils]: 78: Hoare triple {157401#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157401#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:33,833 INFO L290 TraceCheckUtils]: 79: Hoare triple {157401#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157402#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:33,833 INFO L290 TraceCheckUtils]: 80: Hoare triple {157402#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157402#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:33,834 INFO L290 TraceCheckUtils]: 81: Hoare triple {157402#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157403#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:33,834 INFO L290 TraceCheckUtils]: 82: Hoare triple {157403#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157403#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:33,834 INFO L290 TraceCheckUtils]: 83: Hoare triple {157403#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157404#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:33,834 INFO L290 TraceCheckUtils]: 84: Hoare triple {157404#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157404#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:33,834 INFO L290 TraceCheckUtils]: 85: Hoare triple {157404#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157405#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:33,835 INFO L290 TraceCheckUtils]: 86: Hoare triple {157405#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157405#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:33,835 INFO L290 TraceCheckUtils]: 87: Hoare triple {157405#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157406#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:33,835 INFO L290 TraceCheckUtils]: 88: Hoare triple {157406#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157406#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:33,835 INFO L290 TraceCheckUtils]: 89: Hoare triple {157406#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157407#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:33,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {157407#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157407#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:33,836 INFO L290 TraceCheckUtils]: 91: Hoare triple {157407#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157408#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:33,836 INFO L290 TraceCheckUtils]: 92: Hoare triple {157408#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157408#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:33,836 INFO L290 TraceCheckUtils]: 93: Hoare triple {157408#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157409#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:33,836 INFO L290 TraceCheckUtils]: 94: Hoare triple {157409#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157409#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:33,837 INFO L290 TraceCheckUtils]: 95: Hoare triple {157409#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157410#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:33,837 INFO L290 TraceCheckUtils]: 96: Hoare triple {157410#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157410#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:33,837 INFO L290 TraceCheckUtils]: 97: Hoare triple {157410#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157411#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:33,837 INFO L290 TraceCheckUtils]: 98: Hoare triple {157411#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157411#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:33,838 INFO L290 TraceCheckUtils]: 99: Hoare triple {157411#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157412#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:33,838 INFO L290 TraceCheckUtils]: 100: Hoare triple {157412#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157412#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:33,838 INFO L290 TraceCheckUtils]: 101: Hoare triple {157412#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157413#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:33,838 INFO L290 TraceCheckUtils]: 102: Hoare triple {157413#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157413#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:33,838 INFO L290 TraceCheckUtils]: 103: Hoare triple {157413#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157414#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:33,839 INFO L290 TraceCheckUtils]: 104: Hoare triple {157414#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157414#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:33,839 INFO L290 TraceCheckUtils]: 105: Hoare triple {157414#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157415#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:33,839 INFO L290 TraceCheckUtils]: 106: Hoare triple {157415#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157415#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:33,839 INFO L290 TraceCheckUtils]: 107: Hoare triple {157415#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157416#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:33,839 INFO L290 TraceCheckUtils]: 108: Hoare triple {157416#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157416#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:33,840 INFO L290 TraceCheckUtils]: 109: Hoare triple {157416#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157417#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:33,840 INFO L290 TraceCheckUtils]: 110: Hoare triple {157417#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157417#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:33,840 INFO L290 TraceCheckUtils]: 111: Hoare triple {157417#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157418#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:33,840 INFO L290 TraceCheckUtils]: 112: Hoare triple {157418#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157418#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:33,841 INFO L290 TraceCheckUtils]: 113: Hoare triple {157418#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157419#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:33,841 INFO L290 TraceCheckUtils]: 114: Hoare triple {157419#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157419#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:33,841 INFO L290 TraceCheckUtils]: 115: Hoare triple {157419#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157420#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:33,841 INFO L290 TraceCheckUtils]: 116: Hoare triple {157420#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157420#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:33,841 INFO L290 TraceCheckUtils]: 117: Hoare triple {157420#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157421#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:33,842 INFO L290 TraceCheckUtils]: 118: Hoare triple {157421#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157421#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:33,842 INFO L290 TraceCheckUtils]: 119: Hoare triple {157421#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157422#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:33,842 INFO L290 TraceCheckUtils]: 120: Hoare triple {157422#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157422#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:33,842 INFO L290 TraceCheckUtils]: 121: Hoare triple {157422#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157423#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:33,843 INFO L290 TraceCheckUtils]: 122: Hoare triple {157423#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157423#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:33,843 INFO L290 TraceCheckUtils]: 123: Hoare triple {157423#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157424#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:33,843 INFO L290 TraceCheckUtils]: 124: Hoare triple {157424#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157424#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:33,843 INFO L290 TraceCheckUtils]: 125: Hoare triple {157424#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157425#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:33,843 INFO L290 TraceCheckUtils]: 126: Hoare triple {157425#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157425#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:33,844 INFO L290 TraceCheckUtils]: 127: Hoare triple {157425#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157426#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:33,844 INFO L290 TraceCheckUtils]: 128: Hoare triple {157426#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157426#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:33,844 INFO L290 TraceCheckUtils]: 129: Hoare triple {157426#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157427#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:33,844 INFO L290 TraceCheckUtils]: 130: Hoare triple {157427#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157427#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:33,845 INFO L290 TraceCheckUtils]: 131: Hoare triple {157427#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157428#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:33,845 INFO L290 TraceCheckUtils]: 132: Hoare triple {157428#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157428#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:33,845 INFO L290 TraceCheckUtils]: 133: Hoare triple {157428#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157429#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:33,845 INFO L290 TraceCheckUtils]: 134: Hoare triple {157429#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157429#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:33,845 INFO L290 TraceCheckUtils]: 135: Hoare triple {157429#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157430#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:33,846 INFO L290 TraceCheckUtils]: 136: Hoare triple {157430#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157430#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:33,846 INFO L290 TraceCheckUtils]: 137: Hoare triple {157430#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157431#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:33,846 INFO L290 TraceCheckUtils]: 138: Hoare triple {157431#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157431#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:33,846 INFO L290 TraceCheckUtils]: 139: Hoare triple {157431#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157432#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:33,846 INFO L290 TraceCheckUtils]: 140: Hoare triple {157432#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157432#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:33,847 INFO L290 TraceCheckUtils]: 141: Hoare triple {157432#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157433#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:33,847 INFO L290 TraceCheckUtils]: 142: Hoare triple {157433#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157433#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:33,847 INFO L290 TraceCheckUtils]: 143: Hoare triple {157433#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157434#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:33,847 INFO L290 TraceCheckUtils]: 144: Hoare triple {157434#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157434#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 145: Hoare triple {157434#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157435#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 146: Hoare triple {157435#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157435#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 147: Hoare triple {157435#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157436#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 148: Hoare triple {157436#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157436#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 149: Hoare triple {157436#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157437#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 150: Hoare triple {157437#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157437#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 151: Hoare triple {157437#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157438#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 152: Hoare triple {157438#(<= main_~i~0 73)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157438#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 153: Hoare triple {157438#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157439#(<= main_~i~0 74)} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 154: Hoare triple {157439#(<= main_~i~0 74)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157439#(<= main_~i~0 74)} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 155: Hoare triple {157439#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157440#(<= main_~i~0 75)} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 156: Hoare triple {157440#(<= main_~i~0 75)} assume !(~i~0 < 1024); {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 157: Hoare triple {157361#false} ~i~0 := 0; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 158: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 159: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 160: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 161: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 162: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 163: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 164: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 165: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 166: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 167: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 168: Hoare triple {157361#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L272 TraceCheckUtils]: 169: Hoare triple {157361#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 170: Hoare triple {157361#false} ~cond := #in~cond; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 171: Hoare triple {157361#false} assume 0 == ~cond; {157361#false} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 172: Hoare triple {157361#false} assume !false; {157361#false} is VALID [2022-04-28 03:09:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:09:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:33,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594651877] [2022-04-28 03:09:33,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594651877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:33,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026196898] [2022-04-28 03:09:33,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:33,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:33,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:33,853 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:33,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-28 03:09:34,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:34,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:34,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-28 03:09:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:35,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {157360#true} call ULTIMATE.init(); {157360#true} is VALID [2022-04-28 03:09:35,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {157360#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(12, 2); {157360#true} is VALID [2022-04-28 03:09:35,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {157360#true} assume true; {157360#true} is VALID [2022-04-28 03:09:35,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157360#true} {157360#true} #64#return; {157360#true} is VALID [2022-04-28 03:09:35,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {157360#true} call #t~ret6 := main(); {157360#true} is VALID [2022-04-28 03:09:35,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {157360#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {157460#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:35,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {157460#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157460#(<= main_~i~0 0)} is VALID [2022-04-28 03:09:35,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {157460#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157366#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:35,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {157366#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157366#(<= main_~i~0 1)} is VALID [2022-04-28 03:09:35,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {157366#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157367#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:35,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {157367#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157367#(<= main_~i~0 2)} is VALID [2022-04-28 03:09:35,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {157367#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157368#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:35,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {157368#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157368#(<= main_~i~0 3)} is VALID [2022-04-28 03:09:35,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {157368#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157369#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:35,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {157369#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157369#(<= main_~i~0 4)} is VALID [2022-04-28 03:09:35,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {157369#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157370#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:35,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {157370#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157370#(<= main_~i~0 5)} is VALID [2022-04-28 03:09:35,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {157370#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157371#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:35,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {157371#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157371#(<= main_~i~0 6)} is VALID [2022-04-28 03:09:35,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {157371#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157372#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:35,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {157372#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157372#(<= main_~i~0 7)} is VALID [2022-04-28 03:09:35,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {157372#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157373#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:35,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {157373#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157373#(<= main_~i~0 8)} is VALID [2022-04-28 03:09:35,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {157373#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157374#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:35,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {157374#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157374#(<= main_~i~0 9)} is VALID [2022-04-28 03:09:35,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {157374#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157375#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:35,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {157375#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157375#(<= main_~i~0 10)} is VALID [2022-04-28 03:09:35,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {157375#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157376#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:35,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {157376#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157376#(<= main_~i~0 11)} is VALID [2022-04-28 03:09:35,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {157376#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157377#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:35,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {157377#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157377#(<= main_~i~0 12)} is VALID [2022-04-28 03:09:35,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {157377#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157378#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:35,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {157378#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157378#(<= main_~i~0 13)} is VALID [2022-04-28 03:09:35,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {157378#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157379#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:35,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {157379#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157379#(<= main_~i~0 14)} is VALID [2022-04-28 03:09:35,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {157379#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157380#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:35,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {157380#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157380#(<= main_~i~0 15)} is VALID [2022-04-28 03:09:35,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {157380#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157381#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:35,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {157381#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157381#(<= main_~i~0 16)} is VALID [2022-04-28 03:09:35,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {157381#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157382#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:35,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {157382#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157382#(<= main_~i~0 17)} is VALID [2022-04-28 03:09:35,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {157382#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157383#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:35,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {157383#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157383#(<= main_~i~0 18)} is VALID [2022-04-28 03:09:35,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {157383#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157384#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:35,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {157384#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157384#(<= main_~i~0 19)} is VALID [2022-04-28 03:09:35,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {157384#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157385#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:35,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {157385#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157385#(<= main_~i~0 20)} is VALID [2022-04-28 03:09:35,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {157385#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157386#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:35,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {157386#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157386#(<= main_~i~0 21)} is VALID [2022-04-28 03:09:35,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {157386#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157387#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:35,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {157387#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157387#(<= main_~i~0 22)} is VALID [2022-04-28 03:09:35,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {157387#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157388#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:35,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {157388#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157388#(<= main_~i~0 23)} is VALID [2022-04-28 03:09:35,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {157388#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157389#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:35,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {157389#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157389#(<= main_~i~0 24)} is VALID [2022-04-28 03:09:35,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {157389#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157390#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:35,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {157390#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157390#(<= main_~i~0 25)} is VALID [2022-04-28 03:09:35,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {157390#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157391#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:35,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {157391#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157391#(<= main_~i~0 26)} is VALID [2022-04-28 03:09:35,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {157391#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157392#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:35,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {157392#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157392#(<= main_~i~0 27)} is VALID [2022-04-28 03:09:35,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {157392#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157393#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:35,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {157393#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157393#(<= main_~i~0 28)} is VALID [2022-04-28 03:09:35,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {157393#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157394#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:35,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {157394#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157394#(<= main_~i~0 29)} is VALID [2022-04-28 03:09:35,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {157394#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157395#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:35,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {157395#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157395#(<= main_~i~0 30)} is VALID [2022-04-28 03:09:35,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {157395#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157396#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:35,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {157396#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157396#(<= main_~i~0 31)} is VALID [2022-04-28 03:09:35,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {157396#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157397#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:35,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {157397#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157397#(<= main_~i~0 32)} is VALID [2022-04-28 03:09:35,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {157397#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157398#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:35,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {157398#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157398#(<= main_~i~0 33)} is VALID [2022-04-28 03:09:35,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {157398#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157399#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:35,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {157399#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157399#(<= main_~i~0 34)} is VALID [2022-04-28 03:09:35,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {157399#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157400#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:35,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {157400#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157400#(<= main_~i~0 35)} is VALID [2022-04-28 03:09:35,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {157400#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157401#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:35,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {157401#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157401#(<= main_~i~0 36)} is VALID [2022-04-28 03:09:35,066 INFO L290 TraceCheckUtils]: 79: Hoare triple {157401#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157402#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:35,067 INFO L290 TraceCheckUtils]: 80: Hoare triple {157402#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157402#(<= main_~i~0 37)} is VALID [2022-04-28 03:09:35,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {157402#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157403#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:35,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {157403#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157403#(<= main_~i~0 38)} is VALID [2022-04-28 03:09:35,067 INFO L290 TraceCheckUtils]: 83: Hoare triple {157403#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157404#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:35,068 INFO L290 TraceCheckUtils]: 84: Hoare triple {157404#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157404#(<= main_~i~0 39)} is VALID [2022-04-28 03:09:35,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {157404#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157405#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:35,068 INFO L290 TraceCheckUtils]: 86: Hoare triple {157405#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157405#(<= main_~i~0 40)} is VALID [2022-04-28 03:09:35,068 INFO L290 TraceCheckUtils]: 87: Hoare triple {157405#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157406#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:35,068 INFO L290 TraceCheckUtils]: 88: Hoare triple {157406#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157406#(<= main_~i~0 41)} is VALID [2022-04-28 03:09:35,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {157406#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157407#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:35,069 INFO L290 TraceCheckUtils]: 90: Hoare triple {157407#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157407#(<= main_~i~0 42)} is VALID [2022-04-28 03:09:35,069 INFO L290 TraceCheckUtils]: 91: Hoare triple {157407#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157408#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:35,069 INFO L290 TraceCheckUtils]: 92: Hoare triple {157408#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157408#(<= main_~i~0 43)} is VALID [2022-04-28 03:09:35,070 INFO L290 TraceCheckUtils]: 93: Hoare triple {157408#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157409#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:35,070 INFO L290 TraceCheckUtils]: 94: Hoare triple {157409#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157409#(<= main_~i~0 44)} is VALID [2022-04-28 03:09:35,070 INFO L290 TraceCheckUtils]: 95: Hoare triple {157409#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157410#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:35,070 INFO L290 TraceCheckUtils]: 96: Hoare triple {157410#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157410#(<= main_~i~0 45)} is VALID [2022-04-28 03:09:35,070 INFO L290 TraceCheckUtils]: 97: Hoare triple {157410#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157411#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:35,071 INFO L290 TraceCheckUtils]: 98: Hoare triple {157411#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157411#(<= main_~i~0 46)} is VALID [2022-04-28 03:09:35,071 INFO L290 TraceCheckUtils]: 99: Hoare triple {157411#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157412#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:35,071 INFO L290 TraceCheckUtils]: 100: Hoare triple {157412#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157412#(<= main_~i~0 47)} is VALID [2022-04-28 03:09:35,071 INFO L290 TraceCheckUtils]: 101: Hoare triple {157412#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157413#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:35,072 INFO L290 TraceCheckUtils]: 102: Hoare triple {157413#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157413#(<= main_~i~0 48)} is VALID [2022-04-28 03:09:35,072 INFO L290 TraceCheckUtils]: 103: Hoare triple {157413#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157414#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:35,072 INFO L290 TraceCheckUtils]: 104: Hoare triple {157414#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157414#(<= main_~i~0 49)} is VALID [2022-04-28 03:09:35,072 INFO L290 TraceCheckUtils]: 105: Hoare triple {157414#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157415#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:35,072 INFO L290 TraceCheckUtils]: 106: Hoare triple {157415#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157415#(<= main_~i~0 50)} is VALID [2022-04-28 03:09:35,073 INFO L290 TraceCheckUtils]: 107: Hoare triple {157415#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157416#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:35,073 INFO L290 TraceCheckUtils]: 108: Hoare triple {157416#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157416#(<= main_~i~0 51)} is VALID [2022-04-28 03:09:35,073 INFO L290 TraceCheckUtils]: 109: Hoare triple {157416#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157417#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:35,073 INFO L290 TraceCheckUtils]: 110: Hoare triple {157417#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157417#(<= main_~i~0 52)} is VALID [2022-04-28 03:09:35,074 INFO L290 TraceCheckUtils]: 111: Hoare triple {157417#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157418#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:35,074 INFO L290 TraceCheckUtils]: 112: Hoare triple {157418#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157418#(<= main_~i~0 53)} is VALID [2022-04-28 03:09:35,074 INFO L290 TraceCheckUtils]: 113: Hoare triple {157418#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157419#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:35,074 INFO L290 TraceCheckUtils]: 114: Hoare triple {157419#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157419#(<= main_~i~0 54)} is VALID [2022-04-28 03:09:35,074 INFO L290 TraceCheckUtils]: 115: Hoare triple {157419#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157420#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:35,075 INFO L290 TraceCheckUtils]: 116: Hoare triple {157420#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157420#(<= main_~i~0 55)} is VALID [2022-04-28 03:09:35,075 INFO L290 TraceCheckUtils]: 117: Hoare triple {157420#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157421#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:35,075 INFO L290 TraceCheckUtils]: 118: Hoare triple {157421#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157421#(<= main_~i~0 56)} is VALID [2022-04-28 03:09:35,075 INFO L290 TraceCheckUtils]: 119: Hoare triple {157421#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157422#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:35,076 INFO L290 TraceCheckUtils]: 120: Hoare triple {157422#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157422#(<= main_~i~0 57)} is VALID [2022-04-28 03:09:35,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {157422#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157423#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:35,076 INFO L290 TraceCheckUtils]: 122: Hoare triple {157423#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157423#(<= main_~i~0 58)} is VALID [2022-04-28 03:09:35,076 INFO L290 TraceCheckUtils]: 123: Hoare triple {157423#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157424#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:35,076 INFO L290 TraceCheckUtils]: 124: Hoare triple {157424#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157424#(<= main_~i~0 59)} is VALID [2022-04-28 03:09:35,077 INFO L290 TraceCheckUtils]: 125: Hoare triple {157424#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157425#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:35,077 INFO L290 TraceCheckUtils]: 126: Hoare triple {157425#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157425#(<= main_~i~0 60)} is VALID [2022-04-28 03:09:35,077 INFO L290 TraceCheckUtils]: 127: Hoare triple {157425#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157426#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:35,077 INFO L290 TraceCheckUtils]: 128: Hoare triple {157426#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157426#(<= main_~i~0 61)} is VALID [2022-04-28 03:09:35,078 INFO L290 TraceCheckUtils]: 129: Hoare triple {157426#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157427#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:35,078 INFO L290 TraceCheckUtils]: 130: Hoare triple {157427#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157427#(<= main_~i~0 62)} is VALID [2022-04-28 03:09:35,078 INFO L290 TraceCheckUtils]: 131: Hoare triple {157427#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157428#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:35,078 INFO L290 TraceCheckUtils]: 132: Hoare triple {157428#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157428#(<= main_~i~0 63)} is VALID [2022-04-28 03:09:35,078 INFO L290 TraceCheckUtils]: 133: Hoare triple {157428#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157429#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:35,079 INFO L290 TraceCheckUtils]: 134: Hoare triple {157429#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157429#(<= main_~i~0 64)} is VALID [2022-04-28 03:09:35,079 INFO L290 TraceCheckUtils]: 135: Hoare triple {157429#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157430#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:35,079 INFO L290 TraceCheckUtils]: 136: Hoare triple {157430#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157430#(<= main_~i~0 65)} is VALID [2022-04-28 03:09:35,079 INFO L290 TraceCheckUtils]: 137: Hoare triple {157430#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157431#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:35,080 INFO L290 TraceCheckUtils]: 138: Hoare triple {157431#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157431#(<= main_~i~0 66)} is VALID [2022-04-28 03:09:35,080 INFO L290 TraceCheckUtils]: 139: Hoare triple {157431#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157432#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:35,080 INFO L290 TraceCheckUtils]: 140: Hoare triple {157432#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157432#(<= main_~i~0 67)} is VALID [2022-04-28 03:09:35,080 INFO L290 TraceCheckUtils]: 141: Hoare triple {157432#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157433#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:35,080 INFO L290 TraceCheckUtils]: 142: Hoare triple {157433#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157433#(<= main_~i~0 68)} is VALID [2022-04-28 03:09:35,081 INFO L290 TraceCheckUtils]: 143: Hoare triple {157433#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157434#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:35,081 INFO L290 TraceCheckUtils]: 144: Hoare triple {157434#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157434#(<= main_~i~0 69)} is VALID [2022-04-28 03:09:35,081 INFO L290 TraceCheckUtils]: 145: Hoare triple {157434#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157435#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:35,081 INFO L290 TraceCheckUtils]: 146: Hoare triple {157435#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157435#(<= main_~i~0 70)} is VALID [2022-04-28 03:09:35,082 INFO L290 TraceCheckUtils]: 147: Hoare triple {157435#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157436#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:35,082 INFO L290 TraceCheckUtils]: 148: Hoare triple {157436#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157436#(<= main_~i~0 71)} is VALID [2022-04-28 03:09:35,082 INFO L290 TraceCheckUtils]: 149: Hoare triple {157436#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157437#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:35,082 INFO L290 TraceCheckUtils]: 150: Hoare triple {157437#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157437#(<= main_~i~0 72)} is VALID [2022-04-28 03:09:35,082 INFO L290 TraceCheckUtils]: 151: Hoare triple {157437#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157438#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:35,083 INFO L290 TraceCheckUtils]: 152: Hoare triple {157438#(<= main_~i~0 73)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157438#(<= main_~i~0 73)} is VALID [2022-04-28 03:09:35,083 INFO L290 TraceCheckUtils]: 153: Hoare triple {157438#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157439#(<= main_~i~0 74)} is VALID [2022-04-28 03:09:35,083 INFO L290 TraceCheckUtils]: 154: Hoare triple {157439#(<= main_~i~0 74)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {157439#(<= main_~i~0 74)} is VALID [2022-04-28 03:09:35,083 INFO L290 TraceCheckUtils]: 155: Hoare triple {157439#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {157440#(<= main_~i~0 75)} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 156: Hoare triple {157440#(<= main_~i~0 75)} assume !(~i~0 < 1024); {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 157: Hoare triple {157361#false} ~i~0 := 0; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 158: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 159: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 160: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 161: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 162: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 163: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 164: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 165: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 166: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 167: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 168: Hoare triple {157361#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L272 TraceCheckUtils]: 169: Hoare triple {157361#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {157361#false} is VALID [2022-04-28 03:09:35,084 INFO L290 TraceCheckUtils]: 170: Hoare triple {157361#false} ~cond := #in~cond; {157361#false} is VALID [2022-04-28 03:09:35,085 INFO L290 TraceCheckUtils]: 171: Hoare triple {157361#false} assume 0 == ~cond; {157361#false} is VALID [2022-04-28 03:09:35,085 INFO L290 TraceCheckUtils]: 172: Hoare triple {157361#false} assume !false; {157361#false} is VALID [2022-04-28 03:09:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:09:35,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:38,831 INFO L290 TraceCheckUtils]: 172: Hoare triple {157361#false} assume !false; {157361#false} is VALID [2022-04-28 03:09:38,831 INFO L290 TraceCheckUtils]: 171: Hoare triple {157361#false} assume 0 == ~cond; {157361#false} is VALID [2022-04-28 03:09:38,831 INFO L290 TraceCheckUtils]: 170: Hoare triple {157361#false} ~cond := #in~cond; {157361#false} is VALID [2022-04-28 03:09:38,831 INFO L272 TraceCheckUtils]: 169: Hoare triple {157361#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {157361#false} is VALID [2022-04-28 03:09:38,831 INFO L290 TraceCheckUtils]: 168: Hoare triple {157361#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:38,831 INFO L290 TraceCheckUtils]: 167: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 166: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 165: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 164: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 163: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 162: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 161: Hoare triple {157361#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 160: Hoare triple {157361#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 159: Hoare triple {157361#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 158: Hoare triple {157361#false} #t~short5 := ~i~0 < 1024; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 157: Hoare triple {157361#false} ~i~0 := 0; {157361#false} is VALID [2022-04-28 03:09:38,832 INFO L290 TraceCheckUtils]: 156: Hoare triple {158010#(< main_~i~0 1024)} assume !(~i~0 < 1024); {157361#false} is VALID [2022-04-28 03:09:38,833 INFO L290 TraceCheckUtils]: 155: Hoare triple {158014#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158010#(< main_~i~0 1024)} is VALID [2022-04-28 03:09:38,833 INFO L290 TraceCheckUtils]: 154: Hoare triple {158014#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158014#(< main_~i~0 1023)} is VALID [2022-04-28 03:09:38,833 INFO L290 TraceCheckUtils]: 153: Hoare triple {158021#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158014#(< main_~i~0 1023)} is VALID [2022-04-28 03:09:38,833 INFO L290 TraceCheckUtils]: 152: Hoare triple {158021#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158021#(< main_~i~0 1022)} is VALID [2022-04-28 03:09:38,834 INFO L290 TraceCheckUtils]: 151: Hoare triple {158028#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158021#(< main_~i~0 1022)} is VALID [2022-04-28 03:09:38,834 INFO L290 TraceCheckUtils]: 150: Hoare triple {158028#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158028#(< main_~i~0 1021)} is VALID [2022-04-28 03:09:38,834 INFO L290 TraceCheckUtils]: 149: Hoare triple {158035#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158028#(< main_~i~0 1021)} is VALID [2022-04-28 03:09:38,834 INFO L290 TraceCheckUtils]: 148: Hoare triple {158035#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158035#(< main_~i~0 1020)} is VALID [2022-04-28 03:09:38,834 INFO L290 TraceCheckUtils]: 147: Hoare triple {158042#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158035#(< main_~i~0 1020)} is VALID [2022-04-28 03:09:38,835 INFO L290 TraceCheckUtils]: 146: Hoare triple {158042#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158042#(< main_~i~0 1019)} is VALID [2022-04-28 03:09:38,835 INFO L290 TraceCheckUtils]: 145: Hoare triple {158049#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158042#(< main_~i~0 1019)} is VALID [2022-04-28 03:09:38,835 INFO L290 TraceCheckUtils]: 144: Hoare triple {158049#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158049#(< main_~i~0 1018)} is VALID [2022-04-28 03:09:38,835 INFO L290 TraceCheckUtils]: 143: Hoare triple {158056#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158049#(< main_~i~0 1018)} is VALID [2022-04-28 03:09:38,836 INFO L290 TraceCheckUtils]: 142: Hoare triple {158056#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158056#(< main_~i~0 1017)} is VALID [2022-04-28 03:09:38,836 INFO L290 TraceCheckUtils]: 141: Hoare triple {158063#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158056#(< main_~i~0 1017)} is VALID [2022-04-28 03:09:38,836 INFO L290 TraceCheckUtils]: 140: Hoare triple {158063#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158063#(< main_~i~0 1016)} is VALID [2022-04-28 03:09:38,836 INFO L290 TraceCheckUtils]: 139: Hoare triple {158070#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158063#(< main_~i~0 1016)} is VALID [2022-04-28 03:09:38,836 INFO L290 TraceCheckUtils]: 138: Hoare triple {158070#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158070#(< main_~i~0 1015)} is VALID [2022-04-28 03:09:38,837 INFO L290 TraceCheckUtils]: 137: Hoare triple {158077#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158070#(< main_~i~0 1015)} is VALID [2022-04-28 03:09:38,837 INFO L290 TraceCheckUtils]: 136: Hoare triple {158077#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158077#(< main_~i~0 1014)} is VALID [2022-04-28 03:09:38,837 INFO L290 TraceCheckUtils]: 135: Hoare triple {158084#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158077#(< main_~i~0 1014)} is VALID [2022-04-28 03:09:38,837 INFO L290 TraceCheckUtils]: 134: Hoare triple {158084#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158084#(< main_~i~0 1013)} is VALID [2022-04-28 03:09:38,838 INFO L290 TraceCheckUtils]: 133: Hoare triple {158091#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158084#(< main_~i~0 1013)} is VALID [2022-04-28 03:09:38,838 INFO L290 TraceCheckUtils]: 132: Hoare triple {158091#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158091#(< main_~i~0 1012)} is VALID [2022-04-28 03:09:38,838 INFO L290 TraceCheckUtils]: 131: Hoare triple {158098#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158091#(< main_~i~0 1012)} is VALID [2022-04-28 03:09:38,838 INFO L290 TraceCheckUtils]: 130: Hoare triple {158098#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158098#(< main_~i~0 1011)} is VALID [2022-04-28 03:09:38,838 INFO L290 TraceCheckUtils]: 129: Hoare triple {158105#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158098#(< main_~i~0 1011)} is VALID [2022-04-28 03:09:38,839 INFO L290 TraceCheckUtils]: 128: Hoare triple {158105#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158105#(< main_~i~0 1010)} is VALID [2022-04-28 03:09:38,839 INFO L290 TraceCheckUtils]: 127: Hoare triple {158112#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158105#(< main_~i~0 1010)} is VALID [2022-04-28 03:09:38,839 INFO L290 TraceCheckUtils]: 126: Hoare triple {158112#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158112#(< main_~i~0 1009)} is VALID [2022-04-28 03:09:38,839 INFO L290 TraceCheckUtils]: 125: Hoare triple {158119#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158112#(< main_~i~0 1009)} is VALID [2022-04-28 03:09:38,840 INFO L290 TraceCheckUtils]: 124: Hoare triple {158119#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158119#(< main_~i~0 1008)} is VALID [2022-04-28 03:09:38,840 INFO L290 TraceCheckUtils]: 123: Hoare triple {158126#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158119#(< main_~i~0 1008)} is VALID [2022-04-28 03:09:38,840 INFO L290 TraceCheckUtils]: 122: Hoare triple {158126#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158126#(< main_~i~0 1007)} is VALID [2022-04-28 03:09:38,840 INFO L290 TraceCheckUtils]: 121: Hoare triple {158133#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158126#(< main_~i~0 1007)} is VALID [2022-04-28 03:09:38,840 INFO L290 TraceCheckUtils]: 120: Hoare triple {158133#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158133#(< main_~i~0 1006)} is VALID [2022-04-28 03:09:38,841 INFO L290 TraceCheckUtils]: 119: Hoare triple {158140#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158133#(< main_~i~0 1006)} is VALID [2022-04-28 03:09:38,841 INFO L290 TraceCheckUtils]: 118: Hoare triple {158140#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158140#(< main_~i~0 1005)} is VALID [2022-04-28 03:09:38,841 INFO L290 TraceCheckUtils]: 117: Hoare triple {158147#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158140#(< main_~i~0 1005)} is VALID [2022-04-28 03:09:38,841 INFO L290 TraceCheckUtils]: 116: Hoare triple {158147#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158147#(< main_~i~0 1004)} is VALID [2022-04-28 03:09:38,842 INFO L290 TraceCheckUtils]: 115: Hoare triple {158154#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158147#(< main_~i~0 1004)} is VALID [2022-04-28 03:09:38,842 INFO L290 TraceCheckUtils]: 114: Hoare triple {158154#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158154#(< main_~i~0 1003)} is VALID [2022-04-28 03:09:38,842 INFO L290 TraceCheckUtils]: 113: Hoare triple {158161#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158154#(< main_~i~0 1003)} is VALID [2022-04-28 03:09:38,842 INFO L290 TraceCheckUtils]: 112: Hoare triple {158161#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158161#(< main_~i~0 1002)} is VALID [2022-04-28 03:09:38,843 INFO L290 TraceCheckUtils]: 111: Hoare triple {158168#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158161#(< main_~i~0 1002)} is VALID [2022-04-28 03:09:38,843 INFO L290 TraceCheckUtils]: 110: Hoare triple {158168#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158168#(< main_~i~0 1001)} is VALID [2022-04-28 03:09:38,843 INFO L290 TraceCheckUtils]: 109: Hoare triple {158175#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158168#(< main_~i~0 1001)} is VALID [2022-04-28 03:09:38,843 INFO L290 TraceCheckUtils]: 108: Hoare triple {158175#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158175#(< main_~i~0 1000)} is VALID [2022-04-28 03:09:38,843 INFO L290 TraceCheckUtils]: 107: Hoare triple {158182#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158175#(< main_~i~0 1000)} is VALID [2022-04-28 03:09:38,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {158182#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158182#(< main_~i~0 999)} is VALID [2022-04-28 03:09:38,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {158189#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158182#(< main_~i~0 999)} is VALID [2022-04-28 03:09:38,844 INFO L290 TraceCheckUtils]: 104: Hoare triple {158189#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158189#(< main_~i~0 998)} is VALID [2022-04-28 03:09:38,844 INFO L290 TraceCheckUtils]: 103: Hoare triple {158196#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158189#(< main_~i~0 998)} is VALID [2022-04-28 03:09:38,845 INFO L290 TraceCheckUtils]: 102: Hoare triple {158196#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158196#(< main_~i~0 997)} is VALID [2022-04-28 03:09:38,845 INFO L290 TraceCheckUtils]: 101: Hoare triple {158203#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158196#(< main_~i~0 997)} is VALID [2022-04-28 03:09:38,845 INFO L290 TraceCheckUtils]: 100: Hoare triple {158203#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158203#(< main_~i~0 996)} is VALID [2022-04-28 03:09:38,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {158210#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158203#(< main_~i~0 996)} is VALID [2022-04-28 03:09:38,845 INFO L290 TraceCheckUtils]: 98: Hoare triple {158210#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158210#(< main_~i~0 995)} is VALID [2022-04-28 03:09:38,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {158217#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158210#(< main_~i~0 995)} is VALID [2022-04-28 03:09:38,846 INFO L290 TraceCheckUtils]: 96: Hoare triple {158217#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158217#(< main_~i~0 994)} is VALID [2022-04-28 03:09:38,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {158224#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158217#(< main_~i~0 994)} is VALID [2022-04-28 03:09:38,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {158224#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158224#(< main_~i~0 993)} is VALID [2022-04-28 03:09:38,847 INFO L290 TraceCheckUtils]: 93: Hoare triple {158231#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158224#(< main_~i~0 993)} is VALID [2022-04-28 03:09:38,847 INFO L290 TraceCheckUtils]: 92: Hoare triple {158231#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158231#(< main_~i~0 992)} is VALID [2022-04-28 03:09:38,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {158238#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158231#(< main_~i~0 992)} is VALID [2022-04-28 03:09:38,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {158238#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158238#(< main_~i~0 991)} is VALID [2022-04-28 03:09:38,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {158245#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158238#(< main_~i~0 991)} is VALID [2022-04-28 03:09:38,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {158245#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158245#(< main_~i~0 990)} is VALID [2022-04-28 03:09:38,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {158252#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158245#(< main_~i~0 990)} is VALID [2022-04-28 03:09:38,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {158252#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158252#(< main_~i~0 989)} is VALID [2022-04-28 03:09:38,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {158259#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158252#(< main_~i~0 989)} is VALID [2022-04-28 03:09:38,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {158259#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158259#(< main_~i~0 988)} is VALID [2022-04-28 03:09:38,849 INFO L290 TraceCheckUtils]: 83: Hoare triple {158266#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158259#(< main_~i~0 988)} is VALID [2022-04-28 03:09:38,849 INFO L290 TraceCheckUtils]: 82: Hoare triple {158266#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158266#(< main_~i~0 987)} is VALID [2022-04-28 03:09:38,849 INFO L290 TraceCheckUtils]: 81: Hoare triple {158273#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158266#(< main_~i~0 987)} is VALID [2022-04-28 03:09:38,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {158273#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158273#(< main_~i~0 986)} is VALID [2022-04-28 03:09:38,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {158280#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158273#(< main_~i~0 986)} is VALID [2022-04-28 03:09:38,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {158280#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158280#(< main_~i~0 985)} is VALID [2022-04-28 03:09:38,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {158287#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158280#(< main_~i~0 985)} is VALID [2022-04-28 03:09:38,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {158287#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158287#(< main_~i~0 984)} is VALID [2022-04-28 03:09:38,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {158294#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158287#(< main_~i~0 984)} is VALID [2022-04-28 03:09:38,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {158294#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158294#(< main_~i~0 983)} is VALID [2022-04-28 03:09:38,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {158301#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158294#(< main_~i~0 983)} is VALID [2022-04-28 03:09:38,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {158301#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158301#(< main_~i~0 982)} is VALID [2022-04-28 03:09:38,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {158308#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158301#(< main_~i~0 982)} is VALID [2022-04-28 03:09:38,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {158308#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158308#(< main_~i~0 981)} is VALID [2022-04-28 03:09:38,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {158315#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158308#(< main_~i~0 981)} is VALID [2022-04-28 03:09:38,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {158315#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158315#(< main_~i~0 980)} is VALID [2022-04-28 03:09:38,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {158322#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158315#(< main_~i~0 980)} is VALID [2022-04-28 03:09:38,853 INFO L290 TraceCheckUtils]: 66: Hoare triple {158322#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158322#(< main_~i~0 979)} is VALID [2022-04-28 03:09:38,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {158329#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158322#(< main_~i~0 979)} is VALID [2022-04-28 03:09:38,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {158329#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158329#(< main_~i~0 978)} is VALID [2022-04-28 03:09:38,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {158336#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158329#(< main_~i~0 978)} is VALID [2022-04-28 03:09:38,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {158336#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158336#(< main_~i~0 977)} is VALID [2022-04-28 03:09:38,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {158343#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158336#(< main_~i~0 977)} is VALID [2022-04-28 03:09:38,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {158343#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158343#(< main_~i~0 976)} is VALID [2022-04-28 03:09:38,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {158350#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158343#(< main_~i~0 976)} is VALID [2022-04-28 03:09:38,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {158350#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158350#(< main_~i~0 975)} is VALID [2022-04-28 03:09:38,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {158357#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158350#(< main_~i~0 975)} is VALID [2022-04-28 03:09:38,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {158357#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158357#(< main_~i~0 974)} is VALID [2022-04-28 03:09:38,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {158364#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158357#(< main_~i~0 974)} is VALID [2022-04-28 03:09:38,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {158364#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158364#(< main_~i~0 973)} is VALID [2022-04-28 03:09:38,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {158371#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158364#(< main_~i~0 973)} is VALID [2022-04-28 03:09:38,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {158371#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158371#(< main_~i~0 972)} is VALID [2022-04-28 03:09:38,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {158378#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158371#(< main_~i~0 972)} is VALID [2022-04-28 03:09:38,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {158378#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158378#(< main_~i~0 971)} is VALID [2022-04-28 03:09:38,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {158385#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158378#(< main_~i~0 971)} is VALID [2022-04-28 03:09:38,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {158385#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158385#(< main_~i~0 970)} is VALID [2022-04-28 03:09:38,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {158392#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158385#(< main_~i~0 970)} is VALID [2022-04-28 03:09:38,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {158392#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158392#(< main_~i~0 969)} is VALID [2022-04-28 03:09:38,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {158399#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158392#(< main_~i~0 969)} is VALID [2022-04-28 03:09:38,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {158399#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158399#(< main_~i~0 968)} is VALID [2022-04-28 03:09:38,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {158406#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158399#(< main_~i~0 968)} is VALID [2022-04-28 03:09:38,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {158406#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158406#(< main_~i~0 967)} is VALID [2022-04-28 03:09:38,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {158413#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158406#(< main_~i~0 967)} is VALID [2022-04-28 03:09:38,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {158413#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158413#(< main_~i~0 966)} is VALID [2022-04-28 03:09:38,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {158420#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158413#(< main_~i~0 966)} is VALID [2022-04-28 03:09:38,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {158420#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158420#(< main_~i~0 965)} is VALID [2022-04-28 03:09:38,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {158427#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158420#(< main_~i~0 965)} is VALID [2022-04-28 03:09:38,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {158427#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158427#(< main_~i~0 964)} is VALID [2022-04-28 03:09:38,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {158434#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158427#(< main_~i~0 964)} is VALID [2022-04-28 03:09:38,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {158434#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158434#(< main_~i~0 963)} is VALID [2022-04-28 03:09:38,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {158441#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158434#(< main_~i~0 963)} is VALID [2022-04-28 03:09:38,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {158441#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158441#(< main_~i~0 962)} is VALID [2022-04-28 03:09:38,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {158448#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158441#(< main_~i~0 962)} is VALID [2022-04-28 03:09:38,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {158448#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158448#(< main_~i~0 961)} is VALID [2022-04-28 03:09:38,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {158455#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158448#(< main_~i~0 961)} is VALID [2022-04-28 03:09:38,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {158455#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158455#(< main_~i~0 960)} is VALID [2022-04-28 03:09:38,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {158462#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158455#(< main_~i~0 960)} is VALID [2022-04-28 03:09:38,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {158462#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158462#(< main_~i~0 959)} is VALID [2022-04-28 03:09:38,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {158469#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158462#(< main_~i~0 959)} is VALID [2022-04-28 03:09:38,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {158469#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158469#(< main_~i~0 958)} is VALID [2022-04-28 03:09:38,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {158476#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158469#(< main_~i~0 958)} is VALID [2022-04-28 03:09:38,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {158476#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158476#(< main_~i~0 957)} is VALID [2022-04-28 03:09:38,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {158483#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158476#(< main_~i~0 957)} is VALID [2022-04-28 03:09:38,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {158483#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158483#(< main_~i~0 956)} is VALID [2022-04-28 03:09:38,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {158490#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158483#(< main_~i~0 956)} is VALID [2022-04-28 03:09:38,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {158490#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158490#(< main_~i~0 955)} is VALID [2022-04-28 03:09:38,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {158497#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158490#(< main_~i~0 955)} is VALID [2022-04-28 03:09:38,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {158497#(< main_~i~0 954)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158497#(< main_~i~0 954)} is VALID [2022-04-28 03:09:38,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {158504#(< main_~i~0 953)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158497#(< main_~i~0 954)} is VALID [2022-04-28 03:09:38,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {158504#(< main_~i~0 953)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158504#(< main_~i~0 953)} is VALID [2022-04-28 03:09:38,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {158511#(< main_~i~0 952)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158504#(< main_~i~0 953)} is VALID [2022-04-28 03:09:38,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {158511#(< main_~i~0 952)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158511#(< main_~i~0 952)} is VALID [2022-04-28 03:09:38,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {158518#(< main_~i~0 951)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158511#(< main_~i~0 952)} is VALID [2022-04-28 03:09:38,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {158518#(< main_~i~0 951)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158518#(< main_~i~0 951)} is VALID [2022-04-28 03:09:38,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {158525#(< main_~i~0 950)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158518#(< main_~i~0 951)} is VALID [2022-04-28 03:09:38,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {158525#(< main_~i~0 950)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158525#(< main_~i~0 950)} is VALID [2022-04-28 03:09:38,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {158532#(< main_~i~0 949)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158525#(< main_~i~0 950)} is VALID [2022-04-28 03:09:38,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {158532#(< main_~i~0 949)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {158532#(< main_~i~0 949)} is VALID [2022-04-28 03:09:38,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {157360#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {158532#(< main_~i~0 949)} is VALID [2022-04-28 03:09:38,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {157360#true} call #t~ret6 := main(); {157360#true} is VALID [2022-04-28 03:09:38,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157360#true} {157360#true} #64#return; {157360#true} is VALID [2022-04-28 03:09:38,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {157360#true} assume true; {157360#true} is VALID [2022-04-28 03:09:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {157360#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(12, 2); {157360#true} is VALID [2022-04-28 03:09:38,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {157360#true} call ULTIMATE.init(); {157360#true} is VALID [2022-04-28 03:09:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:09:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026196898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:38,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:38,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 156 [2022-04-28 03:09:38,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:38,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58871527] [2022-04-28 03:09:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58871527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:38,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:38,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-28 03:09:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162047938] [2022-04-28 03:09:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 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 173 [2022-04-28 03:09:38,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:38,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:38,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:38,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-28 03:09:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-28 03:09:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11937, Invalid=12243, Unknown=0, NotChecked=0, Total=24180 [2022-04-28 03:09:38,936 INFO L87 Difference]: Start difference. First operand 174 states and 178 transitions. Second operand has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:03,375 INFO L93 Difference]: Finished difference Result 565 states and 721 transitions. [2022-04-28 03:10:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-28 03:10:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 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 173 [2022-04-28 03:10:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 712 transitions. [2022-04-28 03:10:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 712 transitions. [2022-04-28 03:10:03,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 712 transitions. [2022-04-28 03:10:03,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 712 edges. 712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:03,786 INFO L225 Difference]: With dead ends: 565 [2022-04-28 03:10:03,786 INFO L226 Difference]: Without dead ends: 548 [2022-04-28 03:10:03,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=23718, Invalid=29874, Unknown=0, NotChecked=0, Total=53592 [2022-04-28 03:10:03,789 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1944 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:03,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 57 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:10:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-04-28 03:10:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 176. [2022-04-28 03:10:05,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:05,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 548 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:05,228 INFO L74 IsIncluded]: Start isIncluded. First operand 548 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:05,228 INFO L87 Difference]: Start difference. First operand 548 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:05,237 INFO L93 Difference]: Finished difference Result 548 states and 700 transitions. [2022-04-28 03:10:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 700 transitions. [2022-04-28 03:10:05,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:05,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:05,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 548 states. [2022-04-28 03:10:05,237 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 548 states. [2022-04-28 03:10:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:05,246 INFO L93 Difference]: Finished difference Result 548 states and 700 transitions. [2022-04-28 03:10:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 700 transitions. [2022-04-28 03:10:05,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:05,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:05,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:05,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2022-04-28 03:10:05,249 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 173 [2022-04-28 03:10:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:05,249 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2022-04-28 03:10:05,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:05,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 180 transitions. [2022-04-28 03:10:05,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2022-04-28 03:10:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 03:10:05,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:05,844 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:05,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-04-28 03:10:06,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:06,059 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2145657125, now seen corresponding path program 153 times [2022-04-28 03:10:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985735525] [2022-04-28 03:10:06,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:10:06,063 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:10:06,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:10:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2145657125, now seen corresponding path program 154 times [2022-04-28 03:10:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:06,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131537084] [2022-04-28 03:10:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:07,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {161368#(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(12, 2); {161286#true} is VALID [2022-04-28 03:10:07,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {161286#true} assume true; {161286#true} is VALID [2022-04-28 03:10:07,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161286#true} {161286#true} #64#return; {161286#true} is VALID [2022-04-28 03:10:07,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {161286#true} call ULTIMATE.init(); {161368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:07,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {161368#(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(12, 2); {161286#true} is VALID [2022-04-28 03:10:07,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {161286#true} assume true; {161286#true} is VALID [2022-04-28 03:10:07,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161286#true} {161286#true} #64#return; {161286#true} is VALID [2022-04-28 03:10:07,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {161286#true} call #t~ret6 := main(); {161286#true} is VALID [2022-04-28 03:10:07,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {161286#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {161291#(= main_~i~0 0)} is VALID [2022-04-28 03:10:07,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {161291#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161291#(= main_~i~0 0)} is VALID [2022-04-28 03:10:07,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {161291#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161292#(<= main_~i~0 1)} is VALID [2022-04-28 03:10:07,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {161292#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161292#(<= main_~i~0 1)} is VALID [2022-04-28 03:10:07,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {161292#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161293#(<= main_~i~0 2)} is VALID [2022-04-28 03:10:07,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {161293#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161293#(<= main_~i~0 2)} is VALID [2022-04-28 03:10:07,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {161293#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161294#(<= main_~i~0 3)} is VALID [2022-04-28 03:10:07,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {161294#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161294#(<= main_~i~0 3)} is VALID [2022-04-28 03:10:07,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {161294#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161295#(<= main_~i~0 4)} is VALID [2022-04-28 03:10:07,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {161295#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161295#(<= main_~i~0 4)} is VALID [2022-04-28 03:10:07,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {161295#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161296#(<= main_~i~0 5)} is VALID [2022-04-28 03:10:07,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {161296#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161296#(<= main_~i~0 5)} is VALID [2022-04-28 03:10:07,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {161296#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161297#(<= main_~i~0 6)} is VALID [2022-04-28 03:10:07,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {161297#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161297#(<= main_~i~0 6)} is VALID [2022-04-28 03:10:07,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {161297#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161298#(<= main_~i~0 7)} is VALID [2022-04-28 03:10:07,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {161298#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161298#(<= main_~i~0 7)} is VALID [2022-04-28 03:10:07,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {161298#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161299#(<= main_~i~0 8)} is VALID [2022-04-28 03:10:07,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {161299#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161299#(<= main_~i~0 8)} is VALID [2022-04-28 03:10:07,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {161299#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161300#(<= main_~i~0 9)} is VALID [2022-04-28 03:10:07,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {161300#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161300#(<= main_~i~0 9)} is VALID [2022-04-28 03:10:07,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {161300#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161301#(<= main_~i~0 10)} is VALID [2022-04-28 03:10:07,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {161301#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161301#(<= main_~i~0 10)} is VALID [2022-04-28 03:10:07,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {161301#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161302#(<= main_~i~0 11)} is VALID [2022-04-28 03:10:07,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {161302#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161302#(<= main_~i~0 11)} is VALID [2022-04-28 03:10:07,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {161302#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161303#(<= main_~i~0 12)} is VALID [2022-04-28 03:10:07,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {161303#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161303#(<= main_~i~0 12)} is VALID [2022-04-28 03:10:07,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {161303#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161304#(<= main_~i~0 13)} is VALID [2022-04-28 03:10:07,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {161304#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161304#(<= main_~i~0 13)} is VALID [2022-04-28 03:10:07,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {161304#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161305#(<= main_~i~0 14)} is VALID [2022-04-28 03:10:07,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {161305#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161305#(<= main_~i~0 14)} is VALID [2022-04-28 03:10:07,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {161305#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161306#(<= main_~i~0 15)} is VALID [2022-04-28 03:10:07,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {161306#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161306#(<= main_~i~0 15)} is VALID [2022-04-28 03:10:07,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {161306#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161307#(<= main_~i~0 16)} is VALID [2022-04-28 03:10:07,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {161307#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161307#(<= main_~i~0 16)} is VALID [2022-04-28 03:10:07,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {161307#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161308#(<= main_~i~0 17)} is VALID [2022-04-28 03:10:07,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {161308#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161308#(<= main_~i~0 17)} is VALID [2022-04-28 03:10:07,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {161308#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161309#(<= main_~i~0 18)} is VALID [2022-04-28 03:10:07,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {161309#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161309#(<= main_~i~0 18)} is VALID [2022-04-28 03:10:07,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {161309#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161310#(<= main_~i~0 19)} is VALID [2022-04-28 03:10:07,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {161310#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161310#(<= main_~i~0 19)} is VALID [2022-04-28 03:10:07,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {161310#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161311#(<= main_~i~0 20)} is VALID [2022-04-28 03:10:07,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {161311#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161311#(<= main_~i~0 20)} is VALID [2022-04-28 03:10:07,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {161311#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161312#(<= main_~i~0 21)} is VALID [2022-04-28 03:10:07,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {161312#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161312#(<= main_~i~0 21)} is VALID [2022-04-28 03:10:07,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {161312#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161313#(<= main_~i~0 22)} is VALID [2022-04-28 03:10:07,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {161313#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161313#(<= main_~i~0 22)} is VALID [2022-04-28 03:10:07,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {161313#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161314#(<= main_~i~0 23)} is VALID [2022-04-28 03:10:07,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {161314#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161314#(<= main_~i~0 23)} is VALID [2022-04-28 03:10:07,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {161314#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161315#(<= main_~i~0 24)} is VALID [2022-04-28 03:10:07,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {161315#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161315#(<= main_~i~0 24)} is VALID [2022-04-28 03:10:07,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {161315#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161316#(<= main_~i~0 25)} is VALID [2022-04-28 03:10:07,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {161316#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161316#(<= main_~i~0 25)} is VALID [2022-04-28 03:10:07,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {161316#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161317#(<= main_~i~0 26)} is VALID [2022-04-28 03:10:07,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {161317#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161317#(<= main_~i~0 26)} is VALID [2022-04-28 03:10:07,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {161317#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161318#(<= main_~i~0 27)} is VALID [2022-04-28 03:10:07,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {161318#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161318#(<= main_~i~0 27)} is VALID [2022-04-28 03:10:07,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {161318#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161319#(<= main_~i~0 28)} is VALID [2022-04-28 03:10:07,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {161319#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161319#(<= main_~i~0 28)} is VALID [2022-04-28 03:10:07,590 INFO L290 TraceCheckUtils]: 63: Hoare triple {161319#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161320#(<= main_~i~0 29)} is VALID [2022-04-28 03:10:07,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {161320#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161320#(<= main_~i~0 29)} is VALID [2022-04-28 03:10:07,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {161320#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161321#(<= main_~i~0 30)} is VALID [2022-04-28 03:10:07,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {161321#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161321#(<= main_~i~0 30)} is VALID [2022-04-28 03:10:07,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {161321#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161322#(<= main_~i~0 31)} is VALID [2022-04-28 03:10:07,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {161322#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161322#(<= main_~i~0 31)} is VALID [2022-04-28 03:10:07,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {161322#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161323#(<= main_~i~0 32)} is VALID [2022-04-28 03:10:07,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {161323#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161323#(<= main_~i~0 32)} is VALID [2022-04-28 03:10:07,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {161323#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161324#(<= main_~i~0 33)} is VALID [2022-04-28 03:10:07,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {161324#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161324#(<= main_~i~0 33)} is VALID [2022-04-28 03:10:07,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {161324#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161325#(<= main_~i~0 34)} is VALID [2022-04-28 03:10:07,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {161325#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161325#(<= main_~i~0 34)} is VALID [2022-04-28 03:10:07,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {161325#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161326#(<= main_~i~0 35)} is VALID [2022-04-28 03:10:07,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {161326#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161326#(<= main_~i~0 35)} is VALID [2022-04-28 03:10:07,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {161326#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161327#(<= main_~i~0 36)} is VALID [2022-04-28 03:10:07,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {161327#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161327#(<= main_~i~0 36)} is VALID [2022-04-28 03:10:07,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {161327#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161328#(<= main_~i~0 37)} is VALID [2022-04-28 03:10:07,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {161328#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161328#(<= main_~i~0 37)} is VALID [2022-04-28 03:10:07,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {161328#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161329#(<= main_~i~0 38)} is VALID [2022-04-28 03:10:07,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {161329#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161329#(<= main_~i~0 38)} is VALID [2022-04-28 03:10:07,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {161329#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161330#(<= main_~i~0 39)} is VALID [2022-04-28 03:10:07,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {161330#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161330#(<= main_~i~0 39)} is VALID [2022-04-28 03:10:07,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {161330#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161331#(<= main_~i~0 40)} is VALID [2022-04-28 03:10:07,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {161331#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161331#(<= main_~i~0 40)} is VALID [2022-04-28 03:10:07,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {161331#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161332#(<= main_~i~0 41)} is VALID [2022-04-28 03:10:07,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {161332#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161332#(<= main_~i~0 41)} is VALID [2022-04-28 03:10:07,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {161332#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161333#(<= main_~i~0 42)} is VALID [2022-04-28 03:10:07,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {161333#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161333#(<= main_~i~0 42)} is VALID [2022-04-28 03:10:07,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {161333#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161334#(<= main_~i~0 43)} is VALID [2022-04-28 03:10:07,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {161334#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161334#(<= main_~i~0 43)} is VALID [2022-04-28 03:10:07,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {161334#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161335#(<= main_~i~0 44)} is VALID [2022-04-28 03:10:07,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {161335#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161335#(<= main_~i~0 44)} is VALID [2022-04-28 03:10:07,598 INFO L290 TraceCheckUtils]: 95: Hoare triple {161335#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161336#(<= main_~i~0 45)} is VALID [2022-04-28 03:10:07,598 INFO L290 TraceCheckUtils]: 96: Hoare triple {161336#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161336#(<= main_~i~0 45)} is VALID [2022-04-28 03:10:07,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {161336#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161337#(<= main_~i~0 46)} is VALID [2022-04-28 03:10:07,598 INFO L290 TraceCheckUtils]: 98: Hoare triple {161337#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161337#(<= main_~i~0 46)} is VALID [2022-04-28 03:10:07,598 INFO L290 TraceCheckUtils]: 99: Hoare triple {161337#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161338#(<= main_~i~0 47)} is VALID [2022-04-28 03:10:07,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {161338#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161338#(<= main_~i~0 47)} is VALID [2022-04-28 03:10:07,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {161338#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161339#(<= main_~i~0 48)} is VALID [2022-04-28 03:10:07,599 INFO L290 TraceCheckUtils]: 102: Hoare triple {161339#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161339#(<= main_~i~0 48)} is VALID [2022-04-28 03:10:07,599 INFO L290 TraceCheckUtils]: 103: Hoare triple {161339#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161340#(<= main_~i~0 49)} is VALID [2022-04-28 03:10:07,599 INFO L290 TraceCheckUtils]: 104: Hoare triple {161340#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161340#(<= main_~i~0 49)} is VALID [2022-04-28 03:10:07,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {161340#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161341#(<= main_~i~0 50)} is VALID [2022-04-28 03:10:07,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {161341#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161341#(<= main_~i~0 50)} is VALID [2022-04-28 03:10:07,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {161341#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161342#(<= main_~i~0 51)} is VALID [2022-04-28 03:10:07,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {161342#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161342#(<= main_~i~0 51)} is VALID [2022-04-28 03:10:07,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {161342#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161343#(<= main_~i~0 52)} is VALID [2022-04-28 03:10:07,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {161343#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161343#(<= main_~i~0 52)} is VALID [2022-04-28 03:10:07,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {161343#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161344#(<= main_~i~0 53)} is VALID [2022-04-28 03:10:07,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {161344#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161344#(<= main_~i~0 53)} is VALID [2022-04-28 03:10:07,601 INFO L290 TraceCheckUtils]: 113: Hoare triple {161344#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161345#(<= main_~i~0 54)} is VALID [2022-04-28 03:10:07,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {161345#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161345#(<= main_~i~0 54)} is VALID [2022-04-28 03:10:07,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {161345#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161346#(<= main_~i~0 55)} is VALID [2022-04-28 03:10:07,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {161346#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161346#(<= main_~i~0 55)} is VALID [2022-04-28 03:10:07,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {161346#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161347#(<= main_~i~0 56)} is VALID [2022-04-28 03:10:07,603 INFO L290 TraceCheckUtils]: 118: Hoare triple {161347#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161347#(<= main_~i~0 56)} is VALID [2022-04-28 03:10:07,603 INFO L290 TraceCheckUtils]: 119: Hoare triple {161347#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161348#(<= main_~i~0 57)} is VALID [2022-04-28 03:10:07,603 INFO L290 TraceCheckUtils]: 120: Hoare triple {161348#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161348#(<= main_~i~0 57)} is VALID [2022-04-28 03:10:07,603 INFO L290 TraceCheckUtils]: 121: Hoare triple {161348#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161349#(<= main_~i~0 58)} is VALID [2022-04-28 03:10:07,603 INFO L290 TraceCheckUtils]: 122: Hoare triple {161349#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161349#(<= main_~i~0 58)} is VALID [2022-04-28 03:10:07,604 INFO L290 TraceCheckUtils]: 123: Hoare triple {161349#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161350#(<= main_~i~0 59)} is VALID [2022-04-28 03:10:07,604 INFO L290 TraceCheckUtils]: 124: Hoare triple {161350#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161350#(<= main_~i~0 59)} is VALID [2022-04-28 03:10:07,604 INFO L290 TraceCheckUtils]: 125: Hoare triple {161350#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161351#(<= main_~i~0 60)} is VALID [2022-04-28 03:10:07,604 INFO L290 TraceCheckUtils]: 126: Hoare triple {161351#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161351#(<= main_~i~0 60)} is VALID [2022-04-28 03:10:07,605 INFO L290 TraceCheckUtils]: 127: Hoare triple {161351#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161352#(<= main_~i~0 61)} is VALID [2022-04-28 03:10:07,605 INFO L290 TraceCheckUtils]: 128: Hoare triple {161352#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161352#(<= main_~i~0 61)} is VALID [2022-04-28 03:10:07,605 INFO L290 TraceCheckUtils]: 129: Hoare triple {161352#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161353#(<= main_~i~0 62)} is VALID [2022-04-28 03:10:07,605 INFO L290 TraceCheckUtils]: 130: Hoare triple {161353#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161353#(<= main_~i~0 62)} is VALID [2022-04-28 03:10:07,605 INFO L290 TraceCheckUtils]: 131: Hoare triple {161353#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161354#(<= main_~i~0 63)} is VALID [2022-04-28 03:10:07,606 INFO L290 TraceCheckUtils]: 132: Hoare triple {161354#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161354#(<= main_~i~0 63)} is VALID [2022-04-28 03:10:07,606 INFO L290 TraceCheckUtils]: 133: Hoare triple {161354#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161355#(<= main_~i~0 64)} is VALID [2022-04-28 03:10:07,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {161355#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161355#(<= main_~i~0 64)} is VALID [2022-04-28 03:10:07,606 INFO L290 TraceCheckUtils]: 135: Hoare triple {161355#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161356#(<= main_~i~0 65)} is VALID [2022-04-28 03:10:07,607 INFO L290 TraceCheckUtils]: 136: Hoare triple {161356#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161356#(<= main_~i~0 65)} is VALID [2022-04-28 03:10:07,607 INFO L290 TraceCheckUtils]: 137: Hoare triple {161356#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161357#(<= main_~i~0 66)} is VALID [2022-04-28 03:10:07,607 INFO L290 TraceCheckUtils]: 138: Hoare triple {161357#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161357#(<= main_~i~0 66)} is VALID [2022-04-28 03:10:07,607 INFO L290 TraceCheckUtils]: 139: Hoare triple {161357#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161358#(<= main_~i~0 67)} is VALID [2022-04-28 03:10:07,608 INFO L290 TraceCheckUtils]: 140: Hoare triple {161358#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161358#(<= main_~i~0 67)} is VALID [2022-04-28 03:10:07,608 INFO L290 TraceCheckUtils]: 141: Hoare triple {161358#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161359#(<= main_~i~0 68)} is VALID [2022-04-28 03:10:07,608 INFO L290 TraceCheckUtils]: 142: Hoare triple {161359#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161359#(<= main_~i~0 68)} is VALID [2022-04-28 03:10:07,608 INFO L290 TraceCheckUtils]: 143: Hoare triple {161359#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161360#(<= main_~i~0 69)} is VALID [2022-04-28 03:10:07,608 INFO L290 TraceCheckUtils]: 144: Hoare triple {161360#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161360#(<= main_~i~0 69)} is VALID [2022-04-28 03:10:07,609 INFO L290 TraceCheckUtils]: 145: Hoare triple {161360#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161361#(<= main_~i~0 70)} is VALID [2022-04-28 03:10:07,609 INFO L290 TraceCheckUtils]: 146: Hoare triple {161361#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161361#(<= main_~i~0 70)} is VALID [2022-04-28 03:10:07,609 INFO L290 TraceCheckUtils]: 147: Hoare triple {161361#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161362#(<= main_~i~0 71)} is VALID [2022-04-28 03:10:07,609 INFO L290 TraceCheckUtils]: 148: Hoare triple {161362#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161362#(<= main_~i~0 71)} is VALID [2022-04-28 03:10:07,610 INFO L290 TraceCheckUtils]: 149: Hoare triple {161362#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161363#(<= main_~i~0 72)} is VALID [2022-04-28 03:10:07,610 INFO L290 TraceCheckUtils]: 150: Hoare triple {161363#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161363#(<= main_~i~0 72)} is VALID [2022-04-28 03:10:07,610 INFO L290 TraceCheckUtils]: 151: Hoare triple {161363#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161364#(<= main_~i~0 73)} is VALID [2022-04-28 03:10:07,610 INFO L290 TraceCheckUtils]: 152: Hoare triple {161364#(<= main_~i~0 73)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161364#(<= main_~i~0 73)} is VALID [2022-04-28 03:10:07,610 INFO L290 TraceCheckUtils]: 153: Hoare triple {161364#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161365#(<= main_~i~0 74)} is VALID [2022-04-28 03:10:07,611 INFO L290 TraceCheckUtils]: 154: Hoare triple {161365#(<= main_~i~0 74)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161365#(<= main_~i~0 74)} is VALID [2022-04-28 03:10:07,611 INFO L290 TraceCheckUtils]: 155: Hoare triple {161365#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161366#(<= main_~i~0 75)} is VALID [2022-04-28 03:10:07,611 INFO L290 TraceCheckUtils]: 156: Hoare triple {161366#(<= main_~i~0 75)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161366#(<= main_~i~0 75)} is VALID [2022-04-28 03:10:07,611 INFO L290 TraceCheckUtils]: 157: Hoare triple {161366#(<= main_~i~0 75)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161367#(<= main_~i~0 76)} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 158: Hoare triple {161367#(<= main_~i~0 76)} assume !(~i~0 < 1024); {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 159: Hoare triple {161287#false} ~i~0 := 0; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 160: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 161: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 162: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 163: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 164: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 165: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 166: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 167: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 168: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 169: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 170: Hoare triple {161287#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L272 TraceCheckUtils]: 171: Hoare triple {161287#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {161287#false} is VALID [2022-04-28 03:10:07,612 INFO L290 TraceCheckUtils]: 172: Hoare triple {161287#false} ~cond := #in~cond; {161287#false} is VALID [2022-04-28 03:10:07,613 INFO L290 TraceCheckUtils]: 173: Hoare triple {161287#false} assume 0 == ~cond; {161287#false} is VALID [2022-04-28 03:10:07,613 INFO L290 TraceCheckUtils]: 174: Hoare triple {161287#false} assume !false; {161287#false} is VALID [2022-04-28 03:10:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:10:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131537084] [2022-04-28 03:10:07,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131537084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:10:07,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347203971] [2022-04-28 03:10:07,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:10:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:07,615 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:07,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-28 03:10:08,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:10:08,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:10:08,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 03:10:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:08,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:10:08,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {161286#true} call ULTIMATE.init(); {161286#true} is VALID [2022-04-28 03:10:08,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {161286#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(12, 2); {161286#true} is VALID [2022-04-28 03:10:08,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {161286#true} assume true; {161286#true} is VALID [2022-04-28 03:10:08,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161286#true} {161286#true} #64#return; {161286#true} is VALID [2022-04-28 03:10:08,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {161286#true} call #t~ret6 := main(); {161286#true} is VALID [2022-04-28 03:10:08,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {161286#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {161387#(<= main_~i~0 0)} is VALID [2022-04-28 03:10:08,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {161387#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161387#(<= main_~i~0 0)} is VALID [2022-04-28 03:10:08,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {161387#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161292#(<= main_~i~0 1)} is VALID [2022-04-28 03:10:08,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {161292#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161292#(<= main_~i~0 1)} is VALID [2022-04-28 03:10:08,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {161292#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161293#(<= main_~i~0 2)} is VALID [2022-04-28 03:10:08,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {161293#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161293#(<= main_~i~0 2)} is VALID [2022-04-28 03:10:08,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {161293#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161294#(<= main_~i~0 3)} is VALID [2022-04-28 03:10:08,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {161294#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161294#(<= main_~i~0 3)} is VALID [2022-04-28 03:10:08,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {161294#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161295#(<= main_~i~0 4)} is VALID [2022-04-28 03:10:08,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {161295#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161295#(<= main_~i~0 4)} is VALID [2022-04-28 03:10:08,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {161295#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161296#(<= main_~i~0 5)} is VALID [2022-04-28 03:10:08,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {161296#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161296#(<= main_~i~0 5)} is VALID [2022-04-28 03:10:08,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {161296#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161297#(<= main_~i~0 6)} is VALID [2022-04-28 03:10:08,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {161297#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161297#(<= main_~i~0 6)} is VALID [2022-04-28 03:10:08,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {161297#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161298#(<= main_~i~0 7)} is VALID [2022-04-28 03:10:08,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {161298#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161298#(<= main_~i~0 7)} is VALID [2022-04-28 03:10:08,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {161298#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161299#(<= main_~i~0 8)} is VALID [2022-04-28 03:10:08,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {161299#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161299#(<= main_~i~0 8)} is VALID [2022-04-28 03:10:08,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {161299#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161300#(<= main_~i~0 9)} is VALID [2022-04-28 03:10:08,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {161300#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161300#(<= main_~i~0 9)} is VALID [2022-04-28 03:10:08,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {161300#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161301#(<= main_~i~0 10)} is VALID [2022-04-28 03:10:08,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {161301#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161301#(<= main_~i~0 10)} is VALID [2022-04-28 03:10:08,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {161301#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161302#(<= main_~i~0 11)} is VALID [2022-04-28 03:10:08,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {161302#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161302#(<= main_~i~0 11)} is VALID [2022-04-28 03:10:08,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {161302#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161303#(<= main_~i~0 12)} is VALID [2022-04-28 03:10:08,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {161303#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161303#(<= main_~i~0 12)} is VALID [2022-04-28 03:10:08,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {161303#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161304#(<= main_~i~0 13)} is VALID [2022-04-28 03:10:08,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {161304#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161304#(<= main_~i~0 13)} is VALID [2022-04-28 03:10:08,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {161304#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161305#(<= main_~i~0 14)} is VALID [2022-04-28 03:10:08,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {161305#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161305#(<= main_~i~0 14)} is VALID [2022-04-28 03:10:08,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {161305#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161306#(<= main_~i~0 15)} is VALID [2022-04-28 03:10:08,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {161306#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161306#(<= main_~i~0 15)} is VALID [2022-04-28 03:10:08,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {161306#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161307#(<= main_~i~0 16)} is VALID [2022-04-28 03:10:08,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {161307#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161307#(<= main_~i~0 16)} is VALID [2022-04-28 03:10:08,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {161307#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161308#(<= main_~i~0 17)} is VALID [2022-04-28 03:10:08,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {161308#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161308#(<= main_~i~0 17)} is VALID [2022-04-28 03:10:08,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {161308#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161309#(<= main_~i~0 18)} is VALID [2022-04-28 03:10:08,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {161309#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161309#(<= main_~i~0 18)} is VALID [2022-04-28 03:10:08,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {161309#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161310#(<= main_~i~0 19)} is VALID [2022-04-28 03:10:08,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {161310#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161310#(<= main_~i~0 19)} is VALID [2022-04-28 03:10:08,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {161310#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161311#(<= main_~i~0 20)} is VALID [2022-04-28 03:10:08,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {161311#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161311#(<= main_~i~0 20)} is VALID [2022-04-28 03:10:08,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {161311#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161312#(<= main_~i~0 21)} is VALID [2022-04-28 03:10:08,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {161312#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161312#(<= main_~i~0 21)} is VALID [2022-04-28 03:10:08,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {161312#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161313#(<= main_~i~0 22)} is VALID [2022-04-28 03:10:08,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {161313#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161313#(<= main_~i~0 22)} is VALID [2022-04-28 03:10:08,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {161313#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161314#(<= main_~i~0 23)} is VALID [2022-04-28 03:10:08,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {161314#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161314#(<= main_~i~0 23)} is VALID [2022-04-28 03:10:08,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {161314#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161315#(<= main_~i~0 24)} is VALID [2022-04-28 03:10:08,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {161315#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161315#(<= main_~i~0 24)} is VALID [2022-04-28 03:10:08,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {161315#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161316#(<= main_~i~0 25)} is VALID [2022-04-28 03:10:08,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {161316#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161316#(<= main_~i~0 25)} is VALID [2022-04-28 03:10:08,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {161316#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161317#(<= main_~i~0 26)} is VALID [2022-04-28 03:10:08,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {161317#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161317#(<= main_~i~0 26)} is VALID [2022-04-28 03:10:08,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {161317#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161318#(<= main_~i~0 27)} is VALID [2022-04-28 03:10:08,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {161318#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161318#(<= main_~i~0 27)} is VALID [2022-04-28 03:10:08,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {161318#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161319#(<= main_~i~0 28)} is VALID [2022-04-28 03:10:08,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {161319#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161319#(<= main_~i~0 28)} is VALID [2022-04-28 03:10:08,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {161319#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161320#(<= main_~i~0 29)} is VALID [2022-04-28 03:10:08,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {161320#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161320#(<= main_~i~0 29)} is VALID [2022-04-28 03:10:08,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {161320#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161321#(<= main_~i~0 30)} is VALID [2022-04-28 03:10:08,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {161321#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161321#(<= main_~i~0 30)} is VALID [2022-04-28 03:10:08,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {161321#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161322#(<= main_~i~0 31)} is VALID [2022-04-28 03:10:08,748 INFO L290 TraceCheckUtils]: 68: Hoare triple {161322#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161322#(<= main_~i~0 31)} is VALID [2022-04-28 03:10:08,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {161322#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161323#(<= main_~i~0 32)} is VALID [2022-04-28 03:10:08,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {161323#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161323#(<= main_~i~0 32)} is VALID [2022-04-28 03:10:08,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {161323#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161324#(<= main_~i~0 33)} is VALID [2022-04-28 03:10:08,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {161324#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161324#(<= main_~i~0 33)} is VALID [2022-04-28 03:10:08,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {161324#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161325#(<= main_~i~0 34)} is VALID [2022-04-28 03:10:08,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {161325#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161325#(<= main_~i~0 34)} is VALID [2022-04-28 03:10:08,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {161325#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161326#(<= main_~i~0 35)} is VALID [2022-04-28 03:10:08,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {161326#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161326#(<= main_~i~0 35)} is VALID [2022-04-28 03:10:08,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {161326#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161327#(<= main_~i~0 36)} is VALID [2022-04-28 03:10:08,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {161327#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161327#(<= main_~i~0 36)} is VALID [2022-04-28 03:10:08,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {161327#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161328#(<= main_~i~0 37)} is VALID [2022-04-28 03:10:08,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {161328#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161328#(<= main_~i~0 37)} is VALID [2022-04-28 03:10:08,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {161328#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161329#(<= main_~i~0 38)} is VALID [2022-04-28 03:10:08,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {161329#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161329#(<= main_~i~0 38)} is VALID [2022-04-28 03:10:08,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {161329#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161330#(<= main_~i~0 39)} is VALID [2022-04-28 03:10:08,752 INFO L290 TraceCheckUtils]: 84: Hoare triple {161330#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161330#(<= main_~i~0 39)} is VALID [2022-04-28 03:10:08,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {161330#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161331#(<= main_~i~0 40)} is VALID [2022-04-28 03:10:08,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {161331#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161331#(<= main_~i~0 40)} is VALID [2022-04-28 03:10:08,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {161331#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161332#(<= main_~i~0 41)} is VALID [2022-04-28 03:10:08,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {161332#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161332#(<= main_~i~0 41)} is VALID [2022-04-28 03:10:08,753 INFO L290 TraceCheckUtils]: 89: Hoare triple {161332#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161333#(<= main_~i~0 42)} is VALID [2022-04-28 03:10:08,753 INFO L290 TraceCheckUtils]: 90: Hoare triple {161333#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161333#(<= main_~i~0 42)} is VALID [2022-04-28 03:10:08,753 INFO L290 TraceCheckUtils]: 91: Hoare triple {161333#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161334#(<= main_~i~0 43)} is VALID [2022-04-28 03:10:08,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {161334#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161334#(<= main_~i~0 43)} is VALID [2022-04-28 03:10:08,754 INFO L290 TraceCheckUtils]: 93: Hoare triple {161334#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161335#(<= main_~i~0 44)} is VALID [2022-04-28 03:10:08,754 INFO L290 TraceCheckUtils]: 94: Hoare triple {161335#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161335#(<= main_~i~0 44)} is VALID [2022-04-28 03:10:08,754 INFO L290 TraceCheckUtils]: 95: Hoare triple {161335#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161336#(<= main_~i~0 45)} is VALID [2022-04-28 03:10:08,754 INFO L290 TraceCheckUtils]: 96: Hoare triple {161336#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161336#(<= main_~i~0 45)} is VALID [2022-04-28 03:10:08,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {161336#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161337#(<= main_~i~0 46)} is VALID [2022-04-28 03:10:08,755 INFO L290 TraceCheckUtils]: 98: Hoare triple {161337#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161337#(<= main_~i~0 46)} is VALID [2022-04-28 03:10:08,755 INFO L290 TraceCheckUtils]: 99: Hoare triple {161337#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161338#(<= main_~i~0 47)} is VALID [2022-04-28 03:10:08,755 INFO L290 TraceCheckUtils]: 100: Hoare triple {161338#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161338#(<= main_~i~0 47)} is VALID [2022-04-28 03:10:08,755 INFO L290 TraceCheckUtils]: 101: Hoare triple {161338#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161339#(<= main_~i~0 48)} is VALID [2022-04-28 03:10:08,756 INFO L290 TraceCheckUtils]: 102: Hoare triple {161339#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161339#(<= main_~i~0 48)} is VALID [2022-04-28 03:10:08,756 INFO L290 TraceCheckUtils]: 103: Hoare triple {161339#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161340#(<= main_~i~0 49)} is VALID [2022-04-28 03:10:08,756 INFO L290 TraceCheckUtils]: 104: Hoare triple {161340#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161340#(<= main_~i~0 49)} is VALID [2022-04-28 03:10:08,756 INFO L290 TraceCheckUtils]: 105: Hoare triple {161340#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161341#(<= main_~i~0 50)} is VALID [2022-04-28 03:10:08,757 INFO L290 TraceCheckUtils]: 106: Hoare triple {161341#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161341#(<= main_~i~0 50)} is VALID [2022-04-28 03:10:08,757 INFO L290 TraceCheckUtils]: 107: Hoare triple {161341#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161342#(<= main_~i~0 51)} is VALID [2022-04-28 03:10:08,757 INFO L290 TraceCheckUtils]: 108: Hoare triple {161342#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161342#(<= main_~i~0 51)} is VALID [2022-04-28 03:10:08,757 INFO L290 TraceCheckUtils]: 109: Hoare triple {161342#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161343#(<= main_~i~0 52)} is VALID [2022-04-28 03:10:08,757 INFO L290 TraceCheckUtils]: 110: Hoare triple {161343#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161343#(<= main_~i~0 52)} is VALID [2022-04-28 03:10:08,758 INFO L290 TraceCheckUtils]: 111: Hoare triple {161343#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161344#(<= main_~i~0 53)} is VALID [2022-04-28 03:10:08,758 INFO L290 TraceCheckUtils]: 112: Hoare triple {161344#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161344#(<= main_~i~0 53)} is VALID [2022-04-28 03:10:08,758 INFO L290 TraceCheckUtils]: 113: Hoare triple {161344#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161345#(<= main_~i~0 54)} is VALID [2022-04-28 03:10:08,758 INFO L290 TraceCheckUtils]: 114: Hoare triple {161345#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161345#(<= main_~i~0 54)} is VALID [2022-04-28 03:10:08,759 INFO L290 TraceCheckUtils]: 115: Hoare triple {161345#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161346#(<= main_~i~0 55)} is VALID [2022-04-28 03:10:08,759 INFO L290 TraceCheckUtils]: 116: Hoare triple {161346#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161346#(<= main_~i~0 55)} is VALID [2022-04-28 03:10:08,759 INFO L290 TraceCheckUtils]: 117: Hoare triple {161346#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161347#(<= main_~i~0 56)} is VALID [2022-04-28 03:10:08,759 INFO L290 TraceCheckUtils]: 118: Hoare triple {161347#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161347#(<= main_~i~0 56)} is VALID [2022-04-28 03:10:08,759 INFO L290 TraceCheckUtils]: 119: Hoare triple {161347#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161348#(<= main_~i~0 57)} is VALID [2022-04-28 03:10:08,760 INFO L290 TraceCheckUtils]: 120: Hoare triple {161348#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161348#(<= main_~i~0 57)} is VALID [2022-04-28 03:10:08,760 INFO L290 TraceCheckUtils]: 121: Hoare triple {161348#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161349#(<= main_~i~0 58)} is VALID [2022-04-28 03:10:08,760 INFO L290 TraceCheckUtils]: 122: Hoare triple {161349#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161349#(<= main_~i~0 58)} is VALID [2022-04-28 03:10:08,760 INFO L290 TraceCheckUtils]: 123: Hoare triple {161349#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161350#(<= main_~i~0 59)} is VALID [2022-04-28 03:10:08,761 INFO L290 TraceCheckUtils]: 124: Hoare triple {161350#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161350#(<= main_~i~0 59)} is VALID [2022-04-28 03:10:08,761 INFO L290 TraceCheckUtils]: 125: Hoare triple {161350#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161351#(<= main_~i~0 60)} is VALID [2022-04-28 03:10:08,761 INFO L290 TraceCheckUtils]: 126: Hoare triple {161351#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161351#(<= main_~i~0 60)} is VALID [2022-04-28 03:10:08,761 INFO L290 TraceCheckUtils]: 127: Hoare triple {161351#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161352#(<= main_~i~0 61)} is VALID [2022-04-28 03:10:08,761 INFO L290 TraceCheckUtils]: 128: Hoare triple {161352#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161352#(<= main_~i~0 61)} is VALID [2022-04-28 03:10:08,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {161352#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161353#(<= main_~i~0 62)} is VALID [2022-04-28 03:10:08,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {161353#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161353#(<= main_~i~0 62)} is VALID [2022-04-28 03:10:08,762 INFO L290 TraceCheckUtils]: 131: Hoare triple {161353#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161354#(<= main_~i~0 63)} is VALID [2022-04-28 03:10:08,762 INFO L290 TraceCheckUtils]: 132: Hoare triple {161354#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161354#(<= main_~i~0 63)} is VALID [2022-04-28 03:10:08,763 INFO L290 TraceCheckUtils]: 133: Hoare triple {161354#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161355#(<= main_~i~0 64)} is VALID [2022-04-28 03:10:08,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {161355#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161355#(<= main_~i~0 64)} is VALID [2022-04-28 03:10:08,763 INFO L290 TraceCheckUtils]: 135: Hoare triple {161355#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161356#(<= main_~i~0 65)} is VALID [2022-04-28 03:10:08,763 INFO L290 TraceCheckUtils]: 136: Hoare triple {161356#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161356#(<= main_~i~0 65)} is VALID [2022-04-28 03:10:08,764 INFO L290 TraceCheckUtils]: 137: Hoare triple {161356#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161357#(<= main_~i~0 66)} is VALID [2022-04-28 03:10:08,764 INFO L290 TraceCheckUtils]: 138: Hoare triple {161357#(<= main_~i~0 66)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161357#(<= main_~i~0 66)} is VALID [2022-04-28 03:10:08,764 INFO L290 TraceCheckUtils]: 139: Hoare triple {161357#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161358#(<= main_~i~0 67)} is VALID [2022-04-28 03:10:08,764 INFO L290 TraceCheckUtils]: 140: Hoare triple {161358#(<= main_~i~0 67)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161358#(<= main_~i~0 67)} is VALID [2022-04-28 03:10:08,764 INFO L290 TraceCheckUtils]: 141: Hoare triple {161358#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161359#(<= main_~i~0 68)} is VALID [2022-04-28 03:10:08,765 INFO L290 TraceCheckUtils]: 142: Hoare triple {161359#(<= main_~i~0 68)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161359#(<= main_~i~0 68)} is VALID [2022-04-28 03:10:08,765 INFO L290 TraceCheckUtils]: 143: Hoare triple {161359#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161360#(<= main_~i~0 69)} is VALID [2022-04-28 03:10:08,765 INFO L290 TraceCheckUtils]: 144: Hoare triple {161360#(<= main_~i~0 69)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161360#(<= main_~i~0 69)} is VALID [2022-04-28 03:10:08,765 INFO L290 TraceCheckUtils]: 145: Hoare triple {161360#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161361#(<= main_~i~0 70)} is VALID [2022-04-28 03:10:08,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {161361#(<= main_~i~0 70)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161361#(<= main_~i~0 70)} is VALID [2022-04-28 03:10:08,766 INFO L290 TraceCheckUtils]: 147: Hoare triple {161361#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161362#(<= main_~i~0 71)} is VALID [2022-04-28 03:10:08,766 INFO L290 TraceCheckUtils]: 148: Hoare triple {161362#(<= main_~i~0 71)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161362#(<= main_~i~0 71)} is VALID [2022-04-28 03:10:08,766 INFO L290 TraceCheckUtils]: 149: Hoare triple {161362#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161363#(<= main_~i~0 72)} is VALID [2022-04-28 03:10:08,766 INFO L290 TraceCheckUtils]: 150: Hoare triple {161363#(<= main_~i~0 72)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161363#(<= main_~i~0 72)} is VALID [2022-04-28 03:10:08,767 INFO L290 TraceCheckUtils]: 151: Hoare triple {161363#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161364#(<= main_~i~0 73)} is VALID [2022-04-28 03:10:08,767 INFO L290 TraceCheckUtils]: 152: Hoare triple {161364#(<= main_~i~0 73)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161364#(<= main_~i~0 73)} is VALID [2022-04-28 03:10:08,767 INFO L290 TraceCheckUtils]: 153: Hoare triple {161364#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161365#(<= main_~i~0 74)} is VALID [2022-04-28 03:10:08,767 INFO L290 TraceCheckUtils]: 154: Hoare triple {161365#(<= main_~i~0 74)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161365#(<= main_~i~0 74)} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 155: Hoare triple {161365#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161366#(<= main_~i~0 75)} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 156: Hoare triple {161366#(<= main_~i~0 75)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161366#(<= main_~i~0 75)} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 157: Hoare triple {161366#(<= main_~i~0 75)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161367#(<= main_~i~0 76)} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 158: Hoare triple {161367#(<= main_~i~0 76)} assume !(~i~0 < 1024); {161287#false} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 159: Hoare triple {161287#false} ~i~0 := 0; {161287#false} is VALID [2022-04-28 03:10:08,768 INFO L290 TraceCheckUtils]: 160: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 161: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 162: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 163: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 164: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 165: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 166: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 167: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 168: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 169: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 170: Hoare triple {161287#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L272 TraceCheckUtils]: 171: Hoare triple {161287#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 172: Hoare triple {161287#false} ~cond := #in~cond; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 173: Hoare triple {161287#false} assume 0 == ~cond; {161287#false} is VALID [2022-04-28 03:10:08,769 INFO L290 TraceCheckUtils]: 174: Hoare triple {161287#false} assume !false; {161287#false} is VALID [2022-04-28 03:10:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:10:08,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:10:13,186 INFO L290 TraceCheckUtils]: 174: Hoare triple {161287#false} assume !false; {161287#false} is VALID [2022-04-28 03:10:13,186 INFO L290 TraceCheckUtils]: 173: Hoare triple {161287#false} assume 0 == ~cond; {161287#false} is VALID [2022-04-28 03:10:13,186 INFO L290 TraceCheckUtils]: 172: Hoare triple {161287#false} ~cond := #in~cond; {161287#false} is VALID [2022-04-28 03:10:13,186 INFO L272 TraceCheckUtils]: 171: Hoare triple {161287#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {161287#false} is VALID [2022-04-28 03:10:13,186 INFO L290 TraceCheckUtils]: 170: Hoare triple {161287#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 169: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 168: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 167: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 166: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 165: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 164: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 163: Hoare triple {161287#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 162: Hoare triple {161287#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 161: Hoare triple {161287#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 160: Hoare triple {161287#false} #t~short5 := ~i~0 < 1024; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 159: Hoare triple {161287#false} ~i~0 := 0; {161287#false} is VALID [2022-04-28 03:10:13,187 INFO L290 TraceCheckUtils]: 158: Hoare triple {161943#(< main_~i~0 1024)} assume !(~i~0 < 1024); {161287#false} is VALID [2022-04-28 03:10:13,188 INFO L290 TraceCheckUtils]: 157: Hoare triple {161947#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161943#(< main_~i~0 1024)} is VALID [2022-04-28 03:10:13,188 INFO L290 TraceCheckUtils]: 156: Hoare triple {161947#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161947#(< main_~i~0 1023)} is VALID [2022-04-28 03:10:13,188 INFO L290 TraceCheckUtils]: 155: Hoare triple {161954#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161947#(< main_~i~0 1023)} is VALID [2022-04-28 03:10:13,188 INFO L290 TraceCheckUtils]: 154: Hoare triple {161954#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161954#(< main_~i~0 1022)} is VALID [2022-04-28 03:10:13,189 INFO L290 TraceCheckUtils]: 153: Hoare triple {161961#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161954#(< main_~i~0 1022)} is VALID [2022-04-28 03:10:13,189 INFO L290 TraceCheckUtils]: 152: Hoare triple {161961#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161961#(< main_~i~0 1021)} is VALID [2022-04-28 03:10:13,189 INFO L290 TraceCheckUtils]: 151: Hoare triple {161968#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161961#(< main_~i~0 1021)} is VALID [2022-04-28 03:10:13,189 INFO L290 TraceCheckUtils]: 150: Hoare triple {161968#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161968#(< main_~i~0 1020)} is VALID [2022-04-28 03:10:13,190 INFO L290 TraceCheckUtils]: 149: Hoare triple {161975#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161968#(< main_~i~0 1020)} is VALID [2022-04-28 03:10:13,190 INFO L290 TraceCheckUtils]: 148: Hoare triple {161975#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161975#(< main_~i~0 1019)} is VALID [2022-04-28 03:10:13,190 INFO L290 TraceCheckUtils]: 147: Hoare triple {161982#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161975#(< main_~i~0 1019)} is VALID [2022-04-28 03:10:13,190 INFO L290 TraceCheckUtils]: 146: Hoare triple {161982#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161982#(< main_~i~0 1018)} is VALID [2022-04-28 03:10:13,191 INFO L290 TraceCheckUtils]: 145: Hoare triple {161989#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161982#(< main_~i~0 1018)} is VALID [2022-04-28 03:10:13,191 INFO L290 TraceCheckUtils]: 144: Hoare triple {161989#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161989#(< main_~i~0 1017)} is VALID [2022-04-28 03:10:13,191 INFO L290 TraceCheckUtils]: 143: Hoare triple {161996#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161989#(< main_~i~0 1017)} is VALID [2022-04-28 03:10:13,191 INFO L290 TraceCheckUtils]: 142: Hoare triple {161996#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {161996#(< main_~i~0 1016)} is VALID [2022-04-28 03:10:13,191 INFO L290 TraceCheckUtils]: 141: Hoare triple {162003#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {161996#(< main_~i~0 1016)} is VALID [2022-04-28 03:10:13,192 INFO L290 TraceCheckUtils]: 140: Hoare triple {162003#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162003#(< main_~i~0 1015)} is VALID [2022-04-28 03:10:13,192 INFO L290 TraceCheckUtils]: 139: Hoare triple {162010#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162003#(< main_~i~0 1015)} is VALID [2022-04-28 03:10:13,192 INFO L290 TraceCheckUtils]: 138: Hoare triple {162010#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162010#(< main_~i~0 1014)} is VALID [2022-04-28 03:10:13,192 INFO L290 TraceCheckUtils]: 137: Hoare triple {162017#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162010#(< main_~i~0 1014)} is VALID [2022-04-28 03:10:13,193 INFO L290 TraceCheckUtils]: 136: Hoare triple {162017#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162017#(< main_~i~0 1013)} is VALID [2022-04-28 03:10:13,193 INFO L290 TraceCheckUtils]: 135: Hoare triple {162024#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162017#(< main_~i~0 1013)} is VALID [2022-04-28 03:10:13,193 INFO L290 TraceCheckUtils]: 134: Hoare triple {162024#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162024#(< main_~i~0 1012)} is VALID [2022-04-28 03:10:13,193 INFO L290 TraceCheckUtils]: 133: Hoare triple {162031#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162024#(< main_~i~0 1012)} is VALID [2022-04-28 03:10:13,193 INFO L290 TraceCheckUtils]: 132: Hoare triple {162031#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162031#(< main_~i~0 1011)} is VALID [2022-04-28 03:10:13,194 INFO L290 TraceCheckUtils]: 131: Hoare triple {162038#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162031#(< main_~i~0 1011)} is VALID [2022-04-28 03:10:13,194 INFO L290 TraceCheckUtils]: 130: Hoare triple {162038#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162038#(< main_~i~0 1010)} is VALID [2022-04-28 03:10:13,194 INFO L290 TraceCheckUtils]: 129: Hoare triple {162045#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162038#(< main_~i~0 1010)} is VALID [2022-04-28 03:10:13,194 INFO L290 TraceCheckUtils]: 128: Hoare triple {162045#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162045#(< main_~i~0 1009)} is VALID [2022-04-28 03:10:13,195 INFO L290 TraceCheckUtils]: 127: Hoare triple {162052#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162045#(< main_~i~0 1009)} is VALID [2022-04-28 03:10:13,195 INFO L290 TraceCheckUtils]: 126: Hoare triple {162052#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162052#(< main_~i~0 1008)} is VALID [2022-04-28 03:10:13,195 INFO L290 TraceCheckUtils]: 125: Hoare triple {162059#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162052#(< main_~i~0 1008)} is VALID [2022-04-28 03:10:13,195 INFO L290 TraceCheckUtils]: 124: Hoare triple {162059#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162059#(< main_~i~0 1007)} is VALID [2022-04-28 03:10:13,195 INFO L290 TraceCheckUtils]: 123: Hoare triple {162066#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162059#(< main_~i~0 1007)} is VALID [2022-04-28 03:10:13,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {162066#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162066#(< main_~i~0 1006)} is VALID [2022-04-28 03:10:13,196 INFO L290 TraceCheckUtils]: 121: Hoare triple {162073#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162066#(< main_~i~0 1006)} is VALID [2022-04-28 03:10:13,196 INFO L290 TraceCheckUtils]: 120: Hoare triple {162073#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162073#(< main_~i~0 1005)} is VALID [2022-04-28 03:10:13,196 INFO L290 TraceCheckUtils]: 119: Hoare triple {162080#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162073#(< main_~i~0 1005)} is VALID [2022-04-28 03:10:13,197 INFO L290 TraceCheckUtils]: 118: Hoare triple {162080#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162080#(< main_~i~0 1004)} is VALID [2022-04-28 03:10:13,197 INFO L290 TraceCheckUtils]: 117: Hoare triple {162087#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162080#(< main_~i~0 1004)} is VALID [2022-04-28 03:10:13,197 INFO L290 TraceCheckUtils]: 116: Hoare triple {162087#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162087#(< main_~i~0 1003)} is VALID [2022-04-28 03:10:13,197 INFO L290 TraceCheckUtils]: 115: Hoare triple {162094#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162087#(< main_~i~0 1003)} is VALID [2022-04-28 03:10:13,197 INFO L290 TraceCheckUtils]: 114: Hoare triple {162094#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162094#(< main_~i~0 1002)} is VALID [2022-04-28 03:10:13,198 INFO L290 TraceCheckUtils]: 113: Hoare triple {162101#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162094#(< main_~i~0 1002)} is VALID [2022-04-28 03:10:13,198 INFO L290 TraceCheckUtils]: 112: Hoare triple {162101#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162101#(< main_~i~0 1001)} is VALID [2022-04-28 03:10:13,198 INFO L290 TraceCheckUtils]: 111: Hoare triple {162108#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162101#(< main_~i~0 1001)} is VALID [2022-04-28 03:10:13,198 INFO L290 TraceCheckUtils]: 110: Hoare triple {162108#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162108#(< main_~i~0 1000)} is VALID [2022-04-28 03:10:13,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {162115#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162108#(< main_~i~0 1000)} is VALID [2022-04-28 03:10:13,199 INFO L290 TraceCheckUtils]: 108: Hoare triple {162115#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162115#(< main_~i~0 999)} is VALID [2022-04-28 03:10:13,199 INFO L290 TraceCheckUtils]: 107: Hoare triple {162122#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162115#(< main_~i~0 999)} is VALID [2022-04-28 03:10:13,199 INFO L290 TraceCheckUtils]: 106: Hoare triple {162122#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162122#(< main_~i~0 998)} is VALID [2022-04-28 03:10:13,200 INFO L290 TraceCheckUtils]: 105: Hoare triple {162129#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162122#(< main_~i~0 998)} is VALID [2022-04-28 03:10:13,200 INFO L290 TraceCheckUtils]: 104: Hoare triple {162129#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162129#(< main_~i~0 997)} is VALID [2022-04-28 03:10:13,200 INFO L290 TraceCheckUtils]: 103: Hoare triple {162136#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162129#(< main_~i~0 997)} is VALID [2022-04-28 03:10:13,200 INFO L290 TraceCheckUtils]: 102: Hoare triple {162136#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162136#(< main_~i~0 996)} is VALID [2022-04-28 03:10:13,200 INFO L290 TraceCheckUtils]: 101: Hoare triple {162143#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162136#(< main_~i~0 996)} is VALID [2022-04-28 03:10:13,201 INFO L290 TraceCheckUtils]: 100: Hoare triple {162143#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162143#(< main_~i~0 995)} is VALID [2022-04-28 03:10:13,201 INFO L290 TraceCheckUtils]: 99: Hoare triple {162150#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162143#(< main_~i~0 995)} is VALID [2022-04-28 03:10:13,201 INFO L290 TraceCheckUtils]: 98: Hoare triple {162150#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162150#(< main_~i~0 994)} is VALID [2022-04-28 03:10:13,201 INFO L290 TraceCheckUtils]: 97: Hoare triple {162157#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162150#(< main_~i~0 994)} is VALID [2022-04-28 03:10:13,202 INFO L290 TraceCheckUtils]: 96: Hoare triple {162157#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162157#(< main_~i~0 993)} is VALID [2022-04-28 03:10:13,202 INFO L290 TraceCheckUtils]: 95: Hoare triple {162164#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162157#(< main_~i~0 993)} is VALID [2022-04-28 03:10:13,202 INFO L290 TraceCheckUtils]: 94: Hoare triple {162164#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162164#(< main_~i~0 992)} is VALID [2022-04-28 03:10:13,202 INFO L290 TraceCheckUtils]: 93: Hoare triple {162171#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162164#(< main_~i~0 992)} is VALID [2022-04-28 03:10:13,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {162171#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162171#(< main_~i~0 991)} is VALID [2022-04-28 03:10:13,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {162178#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162171#(< main_~i~0 991)} is VALID [2022-04-28 03:10:13,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {162178#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162178#(< main_~i~0 990)} is VALID [2022-04-28 03:10:13,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {162185#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162178#(< main_~i~0 990)} is VALID [2022-04-28 03:10:13,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {162185#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162185#(< main_~i~0 989)} is VALID [2022-04-28 03:10:13,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {162192#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162185#(< main_~i~0 989)} is VALID [2022-04-28 03:10:13,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {162192#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162192#(< main_~i~0 988)} is VALID [2022-04-28 03:10:13,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {162199#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162192#(< main_~i~0 988)} is VALID [2022-04-28 03:10:13,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {162199#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162199#(< main_~i~0 987)} is VALID [2022-04-28 03:10:13,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {162206#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162199#(< main_~i~0 987)} is VALID [2022-04-28 03:10:13,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {162206#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162206#(< main_~i~0 986)} is VALID [2022-04-28 03:10:13,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {162213#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162206#(< main_~i~0 986)} is VALID [2022-04-28 03:10:13,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {162213#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162213#(< main_~i~0 985)} is VALID [2022-04-28 03:10:13,205 INFO L290 TraceCheckUtils]: 79: Hoare triple {162220#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162213#(< main_~i~0 985)} is VALID [2022-04-28 03:10:13,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {162220#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162220#(< main_~i~0 984)} is VALID [2022-04-28 03:10:13,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {162227#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162220#(< main_~i~0 984)} is VALID [2022-04-28 03:10:13,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {162227#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162227#(< main_~i~0 983)} is VALID [2022-04-28 03:10:13,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {162234#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162227#(< main_~i~0 983)} is VALID [2022-04-28 03:10:13,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {162234#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162234#(< main_~i~0 982)} is VALID [2022-04-28 03:10:13,207 INFO L290 TraceCheckUtils]: 73: Hoare triple {162241#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162234#(< main_~i~0 982)} is VALID [2022-04-28 03:10:13,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {162241#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162241#(< main_~i~0 981)} is VALID [2022-04-28 03:10:13,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {162248#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162241#(< main_~i~0 981)} is VALID [2022-04-28 03:10:13,207 INFO L290 TraceCheckUtils]: 70: Hoare triple {162248#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162248#(< main_~i~0 980)} is VALID [2022-04-28 03:10:13,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {162255#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162248#(< main_~i~0 980)} is VALID [2022-04-28 03:10:13,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {162255#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162255#(< main_~i~0 979)} is VALID [2022-04-28 03:10:13,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {162262#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162255#(< main_~i~0 979)} is VALID [2022-04-28 03:10:13,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {162262#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162262#(< main_~i~0 978)} is VALID [2022-04-28 03:10:13,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {162269#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162262#(< main_~i~0 978)} is VALID [2022-04-28 03:10:13,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {162269#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162269#(< main_~i~0 977)} is VALID [2022-04-28 03:10:13,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {162276#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162269#(< main_~i~0 977)} is VALID [2022-04-28 03:10:13,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {162276#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162276#(< main_~i~0 976)} is VALID [2022-04-28 03:10:13,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {162283#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162276#(< main_~i~0 976)} is VALID [2022-04-28 03:10:13,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {162283#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162283#(< main_~i~0 975)} is VALID [2022-04-28 03:10:13,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {162290#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162283#(< main_~i~0 975)} is VALID [2022-04-28 03:10:13,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {162290#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162290#(< main_~i~0 974)} is VALID [2022-04-28 03:10:13,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {162297#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162290#(< main_~i~0 974)} is VALID [2022-04-28 03:10:13,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {162297#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162297#(< main_~i~0 973)} is VALID [2022-04-28 03:10:13,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {162304#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162297#(< main_~i~0 973)} is VALID [2022-04-28 03:10:13,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {162304#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162304#(< main_~i~0 972)} is VALID [2022-04-28 03:10:13,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {162311#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162304#(< main_~i~0 972)} is VALID [2022-04-28 03:10:13,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {162311#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162311#(< main_~i~0 971)} is VALID [2022-04-28 03:10:13,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {162318#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162311#(< main_~i~0 971)} is VALID [2022-04-28 03:10:13,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {162318#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162318#(< main_~i~0 970)} is VALID [2022-04-28 03:10:13,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {162325#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162318#(< main_~i~0 970)} is VALID [2022-04-28 03:10:13,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {162325#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162325#(< main_~i~0 969)} is VALID [2022-04-28 03:10:13,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {162332#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162325#(< main_~i~0 969)} is VALID [2022-04-28 03:10:13,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {162332#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162332#(< main_~i~0 968)} is VALID [2022-04-28 03:10:13,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {162339#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162332#(< main_~i~0 968)} is VALID [2022-04-28 03:10:13,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {162339#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162339#(< main_~i~0 967)} is VALID [2022-04-28 03:10:13,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {162346#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162339#(< main_~i~0 967)} is VALID [2022-04-28 03:10:13,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {162346#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162346#(< main_~i~0 966)} is VALID [2022-04-28 03:10:13,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {162353#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162346#(< main_~i~0 966)} is VALID [2022-04-28 03:10:13,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {162353#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162353#(< main_~i~0 965)} is VALID [2022-04-28 03:10:13,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {162360#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162353#(< main_~i~0 965)} is VALID [2022-04-28 03:10:13,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {162360#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162360#(< main_~i~0 964)} is VALID [2022-04-28 03:10:13,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {162367#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162360#(< main_~i~0 964)} is VALID [2022-04-28 03:10:13,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {162367#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162367#(< main_~i~0 963)} is VALID [2022-04-28 03:10:13,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {162374#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162367#(< main_~i~0 963)} is VALID [2022-04-28 03:10:13,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {162374#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162374#(< main_~i~0 962)} is VALID [2022-04-28 03:10:13,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {162381#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162374#(< main_~i~0 962)} is VALID [2022-04-28 03:10:13,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {162381#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162381#(< main_~i~0 961)} is VALID [2022-04-28 03:10:13,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {162388#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162381#(< main_~i~0 961)} is VALID [2022-04-28 03:10:13,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {162388#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162388#(< main_~i~0 960)} is VALID [2022-04-28 03:10:13,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {162395#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162388#(< main_~i~0 960)} is VALID [2022-04-28 03:10:13,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {162395#(< main_~i~0 959)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162395#(< main_~i~0 959)} is VALID [2022-04-28 03:10:13,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {162402#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162395#(< main_~i~0 959)} is VALID [2022-04-28 03:10:13,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {162402#(< main_~i~0 958)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162402#(< main_~i~0 958)} is VALID [2022-04-28 03:10:13,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {162409#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162402#(< main_~i~0 958)} is VALID [2022-04-28 03:10:13,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {162409#(< main_~i~0 957)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162409#(< main_~i~0 957)} is VALID [2022-04-28 03:10:13,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {162416#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162409#(< main_~i~0 957)} is VALID [2022-04-28 03:10:13,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {162416#(< main_~i~0 956)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162416#(< main_~i~0 956)} is VALID [2022-04-28 03:10:13,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {162423#(< main_~i~0 955)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162416#(< main_~i~0 956)} is VALID [2022-04-28 03:10:13,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {162423#(< main_~i~0 955)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162423#(< main_~i~0 955)} is VALID [2022-04-28 03:10:13,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {162430#(< main_~i~0 954)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162423#(< main_~i~0 955)} is VALID [2022-04-28 03:10:13,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {162430#(< main_~i~0 954)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162430#(< main_~i~0 954)} is VALID [2022-04-28 03:10:13,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {162437#(< main_~i~0 953)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162430#(< main_~i~0 954)} is VALID [2022-04-28 03:10:13,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {162437#(< main_~i~0 953)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162437#(< main_~i~0 953)} is VALID [2022-04-28 03:10:13,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {162444#(< main_~i~0 952)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162437#(< main_~i~0 953)} is VALID [2022-04-28 03:10:13,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {162444#(< main_~i~0 952)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162444#(< main_~i~0 952)} is VALID [2022-04-28 03:10:13,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {162451#(< main_~i~0 951)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162444#(< main_~i~0 952)} is VALID [2022-04-28 03:10:13,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {162451#(< main_~i~0 951)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162451#(< main_~i~0 951)} is VALID [2022-04-28 03:10:13,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {162458#(< main_~i~0 950)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162451#(< main_~i~0 951)} is VALID [2022-04-28 03:10:13,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {162458#(< main_~i~0 950)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162458#(< main_~i~0 950)} is VALID [2022-04-28 03:10:13,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {162465#(< main_~i~0 949)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162458#(< main_~i~0 950)} is VALID [2022-04-28 03:10:13,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {162465#(< main_~i~0 949)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162465#(< main_~i~0 949)} is VALID [2022-04-28 03:10:13,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {162472#(< main_~i~0 948)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {162465#(< main_~i~0 949)} is VALID [2022-04-28 03:10:13,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {162472#(< main_~i~0 948)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {162472#(< main_~i~0 948)} is VALID [2022-04-28 03:10:13,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {161286#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {162472#(< main_~i~0 948)} is VALID [2022-04-28 03:10:13,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {161286#true} call #t~ret6 := main(); {161286#true} is VALID [2022-04-28 03:10:13,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161286#true} {161286#true} #64#return; {161286#true} is VALID [2022-04-28 03:10:13,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {161286#true} assume true; {161286#true} is VALID [2022-04-28 03:10:13,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {161286#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(12, 2); {161286#true} is VALID [2022-04-28 03:10:13,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {161286#true} call ULTIMATE.init(); {161286#true} is VALID [2022-04-28 03:10:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:10:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347203971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:10:13,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:10:13,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79, 79] total 158 [2022-04-28 03:10:13,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985735525] [2022-04-28 03:10:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985735525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:13,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:13,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-04-28 03:10:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487304106] [2022-04-28 03:10:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.0625) internal successors, (165), 79 states have internal predecessors, (165), 2 states have call successors, (3), 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 175 [2022-04-28 03:10:13,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:13,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 80 states, 80 states have (on average 2.0625) internal successors, (165), 79 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:13,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:13,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-28 03:10:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-28 03:10:13,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12248, Invalid=12558, Unknown=0, NotChecked=0, Total=24806 [2022-04-28 03:10:13,294 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand has 80 states, 80 states have (on average 2.0625) internal successors, (165), 79 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)